Back to Search
Start Over
New optimal binary codes of dimensions 9 and 10
- Source :
- IEEE Transactions on Information Theory. Jan, 1997, Vol. v43 Issue n1, p314, 3 p.
- Publication Year :
- 1997
-
Abstract
- Eighteen new codes are presented which improve the bounds on maximum minimum distance for binary linear codes. They are rate (m - r)/pm, [Tau] [greater than or equal to] 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. Index Terms - Optimal binary linear codes, quasi-cyclic codes.
- Subjects :
- Binary trees (Computers) -- Research
Coding theory -- Usage
Subjects
Details
- ISSN :
- 00189448
- Volume :
- v43
- Issue :
- n1
- Database :
- Gale General OneFile
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.19175605