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.
['Ron M. Roth', 'Alexander Zeh']
Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region