Linear codes with small hulls in semi-primitive case

The hull of a linear code is defined to be the intersection of the code and its dual, and was originally introduced to classify finite projective planes. The hull plays an important role in determining the complexity of algorithms for checking permutation equivalence of two linear codes and computing the automorphism group of a linear code. It has been shown that these algorithms are very effective in general if the size of the hull is small. It is clear that the linear codes with the smallest hull are LCD codes and with the second smallest hull are those with one-dimensional hull. In this paper, we employ character sums in semi-primitive case to construct LCD codes and linear codes with one-dimensional hull from cyclotomic fields and multiplicative subgroups of finite fields. Some sufficient and necessary conditions for these codes are obtained, where prime ideal decompositions of prime p in cyclotomic fields play a key role. In addition, we show the non-existence of these codes in some cases.

[1]  Claude Carlet,et al.  Complementary dual codes for counter-measures to side-channel attacks , 2016, Adv. Math. Commun..

[2]  T. Aaron Gulliver,et al.  Linear $$\ell $$ℓ-intersection pairs of codes and their applications , 2018, Des. Codes Cryptogr..

[3]  Gintaras Skersys,et al.  The Average Dimension of the Hull of Cyclic Codes , 2001, Discret. Appl. Math..

[4]  Nicolas Sendrier,et al.  On the Dimension of the Hull , 1997, SIAM J. Discret. Math..

[5]  Lingfei Jin.  Construction of MDS Codes With Complementary Duals , 2017, IEEE Transactions on Information Theory.

[6]  Cunsheng Ding,et al.  LCD Cyclic Codes Over Finite Fields , 2017, IEEE Transactions on Information Theory.

[7]  Sihem Mesnager,et al.  Euclidean and Hermitian LCD MDS codes , 2017, Des. Codes Cryptogr..

[8]  Bocong Chen,et al.  New Constructions of MDS Codes With Complementary Duals , 2017, IEEE Transactions on Information Theory.

[9]  Xiaojing Chen,et al.  MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction , 2019, IEEE Transactions on Information Theory.

[10]  Jennifer D. Key,et al.  Hulls of codes from incidence matrices of connected regular graphs , 2014, Des. Codes Cryptogr..

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

[12]  Shudi Yang,et al.  Weight enumerators of reducible cyclic codes and their dual codes , 2019, Discret. Math..

[13]  Willem H. Haemers,et al.  Spectra of Graphs , 2011 .

[14]  Sihem Mesnager,et al.  Construction of Some Codes Suitable for Both Side Channel and Fault Injection Attacks , 2018, WAIFI.

[15]  Binbin Pang,et al.  On LCD Negacyclic Codes over Finite Fields , 2018, J. Syst. Sci. Complex..

[16]  Patrick Solé,et al.  Quasi-cyclic complementary dual codes , 2016, Finite Fields Their Appl..

[17]  Peng Zeng,et al.  Constructions of Linear Codes With One-Dimensional Hull , 2019, IEEE Transactions on Information Theory.

[18]  Sihem Mesnager,et al.  New Characterization and Parametrization of LCD Codes , 2019, IEEE Transactions on Information Theory.

[19]  James L. Massey,et al.  Linear codes with complementary duals , 1992, Discret. Math..

[20]  Jeffrey S. Leon,et al.  Computing automorphism groups of error-correcting codes , 1982, IEEE Trans. Inf. Theory.

[21]  M. Esmaeili,et al.  On complementary-dual quasi-cyclic codes , 2009, Finite Fields Their Appl..

[22]  Cunsheng Ding,et al.  Two Families of LCD BCH Codes , 2016, IEEE Transactions on Information Theory.

[23]  Claude Carlet,et al.  On Linear Complementary Pairs of Codes , 2018, IEEE Transactions on Information Theory.

[24]  Shudi Yang,et al.  The weight distributions of two classes of p-ary cyclic codes with few weights , 2015, Finite Fields Their Appl..

[25]  Shudi Yang,et al.  A class of three-weight linear codes and their complete weight enumerators , 2016, Cryptography and Communications.

[26]  Shudi Yang,et al.  New LCD MDS codes constructed from generalized Reed–Solomon codes , 2019, Journal of Algebra and Its Applications.

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

[28]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[29]  Haode Yan,et al.  Parameters of LCD BCH codes with two lengths , 2018, Adv. Math. Commun..

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

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

[32]  Nicolas Sendrier,et al.  Finding the permutation between equivalent linear codes: The support splitting algorithm , 2000, IEEE Trans. Inf. Theory.

[33]  Chengju Li,et al.  Weight distributions of cyclic codes with respect to pairwise coprime order elements , 2013, Finite Fields Their Appl..

[34]  J. S. Leon,et al.  Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms , 1991, J. Symb. Comput..

[35]  Sihem Mesnager,et al.  Complementary Dual Algebraic Geometry Codes , 2016, IEEE Transactions on Information Theory.

[36]  N. Sendrier,et al.  On the computation of the automorphism group of a linear code , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[37]  Dongdai Lin,et al.  Complete weight enumerators of two classes of linear codes , 2017, Discret. Math..

[38]  Jon-Lark Kim,et al.  The combinatorics of LCD codes: linear programming bound and orthogonal matrices , 2015, Int. J. Inf. Coding Theory.

[39]  Ruud Pellikaan.  LCD codes over ${\mathbb F}_q $ are as good as linear codes for q at least four , 2017, ArXiv.

[40]  Xiang Yang,et al.  The condition for a cyclic code to have a complementary dual , 1994, Discret. Math..

[41]  Shudi Yang,et al.  The weight enumerator of the duals of a class of cyclic codes with three zeros , 2015, Applicable Algebra in Engineering, Communication and Computing.

[42]  Jennifer D. Key,et al.  Affine and projective planes , 1990, Discret. Math..