Binary cyclic codes from explicit polynomials over GF(2m)

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have very efficient encoding and decoding algorithms. In this paper, monomials and trinomials over finite fields with even characteristic are employed to construct a number of families of binary cyclic codes. Lower bounds on the minimum weight of some families of the cyclic codes are developed. The minimum weights of other families of the codes constructed in this paper are determined. The dimensions of the codes are flexible. Some of the codes presented in this paper are optimal or almost optimal in the sense that they meet some bounds on linear codes. Open problems regarding binary cyclic codes from monomials and trinomials are also presented.

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

[2]  Cunsheng Ding,et al.  Cyclic Codes From the Two-Prime Sequences , 2012, IEEE Transactions on Information Theory.

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

[4]  Jaap Top,et al.  On the Minimal Distance of Binary Self-Dual Cyclic Codes , 2009, IEEE Transactions on Information Theory.

[5]  Leopold Bömer,et al.  Complex sequences over GF(pM) with a two-level autocorrelation function and a large linear span , 1992, IEEE Trans. Inf. Theory.

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

[7]  Tadao Kasami,et al.  The Weight Enumerators for Several Clauses of Subcodes of the 2nd Order Binary Reed-Muller Codes , 1971, Inf. Control..

[8]  Marko J. Moisio,et al.  The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code , 2007, IEEE Transactions on Information Theory.

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Asha Rao,et al.  A Family of Two-Weight Irreducible Cyclic Codes , 2010, IEEE Transactions on Information Theory.

[11]  Cunsheng Ding,et al.  The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.

[12]  A. Robert Calderbank,et al.  A 2-adic approach to the analysis of cyclic codes , 1997, IEEE Trans. Inf. Theory.

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

[14]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[15]  Steven T. Dougherty,et al.  Cyclic Codes Over$$\mathbb{Z}_{4}$$ of Even Length , 2006, Des. Codes Cryptogr..

[16]  J. Park,et al.  Error-Pattern-Correcting Cyclic Codes Tailored to a Prescribed Set of Error Cluster Patterns , 2009, IEEE Transactions on Information Theory.

[17]  Cem Güneri,et al.  Weil-Serre Type Bounds for Cyclic Codes , 2008, IEEE Transactions on Information Theory.

[18]  Keqin Feng,et al.  Cyclic Codes and Sequences From Generalized Coulter–Matthews Function , 2008, IEEE Transactions on Information Theory.

[19]  Shu Lin,et al.  Long BCH Codes Are Bad , 1967, Inf. Control..

[20]  Cunsheng Ding,et al.  Cyclic Codes from Some Monomials and Trinomials , 2013, SIAM J. Discret. Math..

[21]  Lei Hu,et al.  The weight distribution of a class of p-ary cyclic codes , 2010, Finite Fields Their Appl..

[22]  Hai Quang Dinh,et al.  On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions , 2008, Finite Fields Their Appl..

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

[24]  Qiuju Diao,et al.  Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets , 2012, IEEE Transactions on Information Theory.

[25]  Wolfgang Willems,et al.  Is the class of cyclic codes asymptotically good? , 2006, IEEE Transactions on Information Theory.

[26]  Elwyn R. Berlekamp,et al.  Some long cyclic linear binary codes are not so bad , 1974, IEEE Trans. Inf. Theory.

[27]  Cunsheng Ding,et al.  Linear codes from perfect nonlinear mappings and their secret sharing schemes , 2005, IEEE Transactions on Information Theory.

[28]  Pavan Kumar,et al.  Minimum Distance Bounds For Cyclic Codes And Deligne's Theorem , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[29]  Chaoping Xing,et al.  On Self-Dual Cyclic Codes Over Finite Fields , 2011, IEEE Transactions on Information Theory.

[30]  Tao Feng.  On cyclic codes of length $${2^{2^r}-1}$$ with two zeros whose dual codes have three weights , 2012, Des. Codes Cryptogr..

[31]  Cunsheng Ding,et al.  A family of skew Hadamard difference sets , 2006, J. Comb. Theory, Ser. A.

[32]  Cunsheng Ding,et al.  A simple stream cipher with proven properties , 2011, Cryptography and Communications.