Abstract
Eighteen new codes are presented which improve the bounds on maximum minimum distance for binary linear codes. They are rate (m-r)/pm, r/spl ges/1, degenerate quasi-cyclic (QC) codes. Based on the known upper bounds, six of these new codes are optimal. In addition, five two-weight QC codes of dimension 8 are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
