Sammanfattning
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In thispaper, a method to conduct a computer search for binary 2-generator QC codes is presented, anda large number of good 2-generator QC codes have been obtained. 5 new binary QC codes thatimprove the lower bounds on minimum distance are presented. Furthermore, with new 2-generatorQC codes and Construction X, 2 new improved binary linear codes are obtained. With the standardconstruction techniques, another 16 new binary linear codes that improve the lower bound on theminimum distance have also been obtained.
| Originalspråk | Engelska |
|---|---|
| Sidor (från-till) | 65-70 |
| Antal sidor | 5 |
| Tidskrift | Journal of Algebra Combinatorics Discrete Structures and Applications |
| Volym | 5 |
| Nummer | 2 |
| DOI | |
| Status | Publicerad - 2018 |
Nationell ämneskategori
- Elektroteknik och elektronik (202)