Some Generalizations of Good Integers and Their Applications in the Study of Self-Dual Negacyclic Codes

Good integers introduced in 1997 form an interesting family of integers that has been continuously studied due to their rich number theoretical properties and wide applications. In this paper, we have focused on classes of $2^\beta$-good integers, $2^\beta$-oddly-good integers, and $2^\beta$-evenly-good integers which are generalizations of good integers. Properties of such integers have been given as well as their applications in characterizing and enumerating self-dual negacyclic codes over finite fields. An alternative proof for the characterization of the existence of a self-dual negacyclic code over finite fields have been given in terms of such generalized good integers. A general enumeration formula for the number of self-dual negacyclic codes of length $n$ over finite fields has been established. For some specific lengths, explicit formulas have been provided as well. Some known results on self-dual negacyclic codes over finite fields can be formalized and viewed as special cases of this work.

[1]  Pieter Moree.  On the divisors of $a^k + b^k$ , 1997 .

[2]  Patanee Udomkavanich,et al.  Hulls of cyclic and negacyclic codes over finite fields , 2015, Finite Fields Their Appl..

[3]  Anuradha Sharma.  Self-dual and self-orthogonal negacyclic codes of length 2mpn over a finite field , 2015, Discret. Math..

[4]  H. Dinh.  Constacyclic Codes of Length p^s Over Fpm + uFpm , 2010 .

[5]  Madhu Raka,et al.  A class of constacyclic codes over a finite field-II , 2015 .

[6]  Hongwei Liu,et al.  Abelian Codes in Principal Ideal Group Algebras , 2013, IEEE Transactions on Information Theory.

[8]  Shixin Zhu,et al.  Repeated-root constacyclic codes of length nlps , 2017, Discret. Math..

[9]  T. Aaron Gulliver,et al.  Self-dual repeated root cyclic and negacyclic codes over finite fields , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[11]  Madhu Raka,et al.  Self-dual and self-orthogonal negacyclic codes of length 2pn over a finite field , 2013, Finite Fields Their Appl..

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

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

[14]  Somphong Jitman.  Good integers and some applications in coding theory , 2017, Cryptography and Communications.

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

[16]  Patrick Solé,et al.  Hermitian Self-Dual Abelian Codes , 2014, IEEE Transactions on Information Theory.

[17]  Hai Q. Dinh,et al.  Constacyclic codes of length 2p s over F p m +uF p m . , 2016 .

[18]  Madhu Raka,et al.  A class of constacyclic codes over a finite field-II , 2012, Indian Journal of Pure and Applied Mathematics.

[19]  Thomas Blackford.  Negacyclic duadic codes , 2008, Finite Fields Their Appl..

[20]  Hai Q. Dinh,et al.  Repeated-root constacyclic codes of length 2ps , 2012, Finite Fields Their Appl..

[21]  Herbert D. Goldman,et al.  Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes , 1969, IEEE Trans. Inf. Theory.

[22]  Melvyn B. Nathanson,et al.  Elementary Methods in Number Theory , 1999 .