Lee weight distributions of trace codes over $\mathbb{F}_q+u\mathbb{F}_q$ from irreducible cyclic codes
DOI:
https://doi.org/10.13069/jacodesmath.v10i2.197Keywords:
Codes over a ring, Trace codes, Semiprimitive codes and cyclotomic classes, Irreducible cyclic codesAbstract
The construction of two or few-weight codes from trace codes over the ring $\mathbb{F}_q+u\mathbb{F}_q$, where $u^2=0$, was recently presented in [4]. For such construction, the defining sets for the trace codes are given in terms of cyclotomic classes, and for some of these classes, it is shown that it is possible to obtain the Lee weight distributions of the corresponding trace codes. Motivated by this construction, and by the $p$-ary semiprimitive irreducible cyclic codes over a prime field $\mathbb{F}_p$, the Lee weight distributions of an infinite family of $p$-ary three-weight codes from trace codes over the ring $\mathbb{F}_p+u\mathbb{F}_p$, was recentely found in [11]. In this work, we prove that the Lee weight distribution problem for the trace codes constructed in accordance with either [4] or [11], is equivalent to the weight distribution problem for the irreducible cyclic codes. With this equivalence in mind, and by using the already known weight distributions of an infinite family irreducible cyclic codes (semiprimitive and not semiprimitive), we follow the open problem suggested in the Conclusion of [11] to determine the Lee weight distribution of an infinite family of trace codes over the ring $\mathbb{F}_q+u\mathbb{F}_q$, that includes the infinite family found in [11].
Received: 16 March 2021 Accepted: 31 October 2022Downloads
References
P. Delsarte, On subfield subcodes of modified Reed-Solomon codes, IEEE Trans. Inform. Theory 21(5) (1975) 575–576.
C. Ding and J. Yang, Hamming weights in irreducible cyclic codes, Discrete Math. 313(4) (2013) 434–446.
R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge, 1997.
H. Liu and Y. Maouche, Two or few-weight trace codes over $\mathbb{F}_q+u\mathbb{F}_q$, IEEE Trans. Inform. Theory 65(5) (2019) 2696–2703.
G. Luo, X. Cao, G. Xu, and S. Xu, A new class of optimal linear codes with flexible parameters, Discrete Appl. Math. 237 (2018) 126–131.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
B. Schmidt and C. White, All two-weight irreducible cyclic codes?, Finite Fields Appl. 8(1) (2002) 1–17.
M. Shi, Y. Liu, and P. Solé, Optimal two-weight codes from trace codes over $\mathbb{F}_2+u\mathbb{F}_2$, IEEE Commun. Lett. 20(12) (2016) 2346–2349.
M. Shi, R. Wu, Y. Liu, and P. Solé, Two and three weight codes over $\mathbb{F}_p+u\mathbb{F}_p$, Cryptogr. Commun. 9(5) (2017) 637–646.
M. Shi, Y. Guan, and P. Solé, Two new families of two-weight codes, IEEE Trans. Inform. Theory 63(10) (2017) 6240–6246.
M. Shi, T. Helleseth, and P. Solé, Three-weight codes from semiprimitive irreducible cyclic codes, Preprint, 2019.
M. Shi, Y. Guan, C. Wang, and P. Solé, Few-weight codes from trace codes over $R_k$, Bull. Aust. Math. Soc. 98(1) (2018) 167–174.
M. Shi, Y. Liu, and P. Solé, Optimal binary codes from trace codes over a non-chain ring, Discrete Appl. Math. 219 (2017) 176–181.
M. Shi, L. Qian, and P. Solé, Few-weight codes from trace codes over a local ring, Appl. Algebra Engrg. Comm. Comput. 29(4) (2018) 335–350.
M. Shi, H. Zhu, and P. Solé, Optimal three-weight cubic codes, Appl. Comput. Math. 17(2) (2018) 175–184.
M. Shi, R. Wu, L. Qian, L. Sok, and P. Solé, New classes of p-ary few weight codes, Bull. Malays. Math. Sci. Soc. 42(4) (2019) 1393–1412.
G. Vega, A characterization of all semiprimitive irreducible cyclic codes in terms of their lengths, Appl. Algebra Engrg. Comm. Comput. 30(5) (2019) 441–452.