Cyclic codes from cyclotomic sequences of order four

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In this paper, three cyclotomic sequences of order four are employed to construct a number of classes of cyclic codes over $\gf(q)$ with prime length. Under certain conditions lower bounds on the minimum weight are developed. Some of the codes obtained are optimal or almost optimal. In general, the cyclic codes constructed in this paper are very good. Some of the cyclic codes obtained in this paper are closely related to almost difference sets and difference sets. As a byproduct, the $p$-rank of these (almost) difference sets are computed.

[1]  W. Marsden.  I and J , 2012 .

[2]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[3]  Pascale Charpin,et al.  Open problems on cyclic codes , 2009 .

[4]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[5]  Rudolf Lide,et al.  Finite fields , 1983 .

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

[7]  Massimiliano Sala,et al.  A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set , 2006, IEEE Transactions on Information Theory.

[8]  Qi Cheng,et al.  On the list and bounded distance decodibility of Reed-Solomon codes , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[9]  Vera Pless,et al.  Duadic Codes , 1984, IEEE Trans. Inf. Theory.

[10]  Marijn van Eupen,et al.  On the minimum distance of ternary cyclic codes , 1993, IEEE Trans. Inf. Theory.

[11]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[12]  G. David Forney,et al.  On decoding BCH codes , 1965, IEEE Trans. Inf. Theory.

[13]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[14]  Vera Pless,et al.  On weights in duadic codes , 1987, J. Comb. Theory, Ser. A.

[15]  Qi Cheng,et al.  Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes , 2010, IEEE Transactions on Information Theory.

[16]  K. Williams,et al.  Gauss and Jacobi sums , 2021, Mathematical Surveys and Monographs.

[17]  Robert Winter,et al.  Dimensional crossover in Sr2RuO4 within a slave-boson mean-field theory , 2008, 0812.3731.

[18]  Qi Cheng,et al.  Complexity of Decoding Positive-Rate Reed-Solomon Codes , 2008, ICALP.

[19]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[20]  Cunsheng Ding,et al.  Cyclotomy and Duadic Codes of Prime Lengths , 1999, IEEE Trans. Inf. Theory.

[21]  Cunsheng Ding,et al.  Almost difference sets and their sequences with optimal autocorrelation , 2001, IEEE Trans. Inf. Theory.

[22]  E. Weldon.  Difference-set cyclic codes , 1966 .

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

[24]  Cunsheng Ding,et al.  Construction and Enumeration of All Binary Duadic Codes of Length pm , 1999, Fundam. Informaticae.

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

[26]  Nigel Boston.  Bounding minimum distances of cyclic codes using algebraic geometry , 2001, Electron. Notes Discret. Math..

[27]  Philippe Delsarte,et al.  On subfield subcodes of modified Reed-Solomon codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[28]  Robert T. Chien,et al.  Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes , 1964, IEEE Trans. Inf. Theory.

[29]  Cunsheng Ding,et al.  Hamming weights in irreducible cyclic codes , 2011, Discret. Math..

[30]  T. Storer.  Cyclotomy and difference sets , 1967 .

[31]  Cunsheng Ding,et al.  Several classes of binary sequences with three-level autocorrelation , 1999, IEEE Trans. Inf. Theory.

[32]  Daniel Augot,et al.  Bounds on the minimum distance of the duals of BCH codes , 1996, IEEE Trans. Inf. Theory.