Abstract
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and 3-generator QC codes are studied, and many good, new QC codes are constructed from simplex codes. Some new binary QC codes or related codes, that improve the bounds on maximum minimum distance for binary linear codes are constructed. They are 5-generator QC [93 17 34] and [254,23, 102] codes, and related [96, 17, 361, [256, 23,104] codes.
| Original language | English |
|---|---|
| Pages (from-to) | 1193-1196 |
| Number of pages | 3 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 53 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2007 |
Swedish Standard Keywords
- Engineering and Technology (2)
Keywords
- Binary linear codes
- quasi-cyclic codes
- simplex codes
Fingerprint
Dive into the research topics of 'New quasi-cyclic codes from simplex codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver