Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 65-70 |
| Number of pages | 5 |
| Journal | Journal of Algebra Combinatorics Discrete Structures and Applications |
| Volume | 5 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2018 |
Swedish Standard Keywords
- Electrical Engineering, Electronic Engineering, Information Engineering (202)
Keywords
- Algorithms
- Binary linear codes
- Quasi-cyclic codes
Fingerprint
Dive into the research topics of 'Some new binary codes with improved minimum distances'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver