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.
KeywordsLinear code Hull LCD code Cyclotomic field Character sum
Mathematics Subject Classification94B05 11T24 11T71
The authors are very grateful to the editor and the reviewers for their detailed comments and suggestions that much improved the presentation and quality of this paper. The work was supported by the National Natural Science Foundation of China under Grant 11701179, the Shanghai Chenguang Program under Grant 18CG22, the Shanghai Sailing Program under Grant 17YF1404300, the Foundation of State Key Laboratory of Integrated Services Networks under Grant ISN20-02, and the SECODE project in the scope of the CHIST-ERA Program.
- 4.Carlet C., Guilley S.: Complementary dual codes for counter-measures to side-channel attacks. In: E.R. Pinto et al. (eds.), Coding Theory and Applications. CIM Series in Mathematical Sciences, vol. 3, pp. 97–105, Springer (2014). J. Adv. Math. Commun. 10(1), 131–150 (2016).Google Scholar
- 16.Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de (2019). Accessed 2 Jan 2019.
- 17.Guenda K., Gulliver T.A., Jitman S., Satanan T.: Linear \(\ell \)-intersection pairs of codes and their applications. arXiv:1810.05103 (2018).
- 35.Sendrier N., Skersys G.: On the computation of the automorphism group of a linear code. In: Proceedings of IEEE ISIT’2001, vol. 13, Washington, DC (2001).Google Scholar