Back to Search
Start Over
Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region.
- Source :
- IEEE Transactions on Information Theory; Jan2017, Vol. 63 Issue 1, p150-158, 9p
- Publication Year :
- 2017
-
Abstract
- An explicit construction of an infinite family of cyclic codes is presented which, over GF(4) (resp., GF(8)), have approximately 8/9 (resp., 48/49) the redundancy of BCH codes of the same minimum distance and length. As such, the new codes are the best codes currently known in a regime where the minimum distance is fixed and the code length goes to infinity. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 63
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 120414460
- Full Text :
- https://doi.org/10.1109/TIT.2016.2627078