Back to Search
Start Over
Optimal Binary Linear Codes From Maximal Arcs.
- Source :
-
IEEE Transactions on Information Theory . Sep2020, Vol. 66 Issue 9, p5387-5394. 8p. - Publication Year :
- 2020
-
Abstract
- The binary Hamming codes with parameters $[{2^{m}-1, 2^{m}-1-m, 3}]$ are perfect. Their extended codes have parameters $[{2^{m}, 2^{m}-1-m, 4}]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes with parameters $[{2^{m+s}+2^{s}-2^{m},2^{m+s}+2^{s}-2^{m}-2m-2,4}]$ , which have better information rates than the class of extended binary Hamming codes, and are also distance-optimal. The second objective is to construct a class of distance-optimal binary codes with parameters $[{2^{m}+2, 2^{m}-2m, 6}]$. Both classes of binary linear codes have new parameters. [ABSTRACT FROM AUTHOR]
- Subjects :
- *LINEAR codes
*BINARY codes
*HAMMING codes
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 66
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 145287369
- Full Text :
- https://doi.org/10.1109/TIT.2020.2970405