A q-polynomial approach to constacyclic codes

Abstract As a generalization of cyclic codes, constacyclic codes is an important and interesting class of codes due to their nice algebraic structures and various applications in engineering. This paper is devoted to the study of the q-polynomial approach to constacyclic codes. Fundamental theory of this approach will be developed, and will be employed to construct some families of optimal and almost optimal codes in this paper.

[1]  Yun Fan,et al.  Polyadic Constacyclic Codes , 2015, IEEE Transactions on Information Theory.

[2]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[3]  Cunsheng Ding,et al.  A Family of Five-Weight Cyclic Codes and Their Weight Enumerators , 2013, IEEE Transactions on Information Theory.

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

[5]  Cunsheng Ding,et al.  A q-polynomial approach to cyclic codes , 2013, Finite Fields Their Appl..

[6]  Giuliano G. La Guardia.  On optimal constacyclic codes , 2013, ArXiv.

[7]  Can Xiang.  Another q-Polynomial Approach to Cyclic Codes , 2016, ArXiv.

[8]  Wenchao Cai,et al.  On self-dual constacyclic codes over finite fields , 2015, Des. Codes Cryptogr..

[9]  Guozhen Xiao,et al.  New developments in q-polynomial codes , 2015, Cryptography and Communications.

[10]  Minjia Shi,et al.  Quasi-twisted codes with constacyclic constituent codes , 2016, Finite Fields Their Appl..

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

[12]  Dwijendra K. Ray-Chaudhuri,et al.  The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes , 2001, Des. Codes Cryptogr..

[13]  Shixin Zhu,et al.  Constacyclic Codes and Some New Quantum MDS Codes , 2014, IEEE Transactions on Information Theory.

[14]  Hongwei Liu,et al.  Constacyclic codes over finite fields , 2012, Finite Fields Their Appl..