A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set

A new lower bound for the distance of cyclic codes is proposed. This bound depends on the defining set of the code, like several other bounds. The proposed bound improves upon the Bose-Chaudhuri-Hocquehghen (BCH) bound and, for some codes, improves upon the Hartmann-Tzeng bound and the Roos bound as well

[1]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[2]  Venkatesan Guruswami,et al.  Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.

[3]  Venkatesan Guruswami.  Better extractors for better codes? , 2004, STOC '04.

[4]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[6]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[7]  T. Schaub.  A linear complexity approach to cyclic codes , 1988 .

[8]  Amnon Ta-Shma,et al.  Storing information with extractors , 2002, Inf. Process. Lett..

[9]  Carlos R. P. Hartmann,et al.  Generalizations of the BCH Bound , 1972, Inf. Control..

[10]  Kees Roos,et al.  A new lower bound for the minimum distance of a cyclic code , 1983, IEEE Trans. Inf. Theory.

[11]  M. Sala,et al.  A lower bound on the distance of cyclic codes , 2003 .

[12]  Dwijendra K. Ray-Chaudhuri,et al.  Binary mixture flow with free energy lattice Boltzmann methods , 2022, arXiv.org.

[13]  Jaikumar Radhakrishnan,et al.  Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..

[14]  Richard M. Wilson,et al.  On the minimum distance of cyclic codes , 1986, IEEE Trans. Inf. Theory.

[15]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.