Abstract
For any \((1+u^2)\)-constacyclic code C with arbitrary length N over \(\mathbb {F}_2[u]/\langle u^3\rangle \), we construct a new map \(\Phi \) from \((\mathbb {F}_2[u]/\langle u^3\rangle )^{N}\) to \((\mathbb {F}_2[v]/\langle v^2\rangle )^{2N}\), and derive \(\Phi (C)\) by applying the map to each codeword of C. We find that C and its image \(\Phi (C)\) have the same homogeneous distance, and the cyclic shift of any codeword of \(\Phi (C)\) is still contained in \(\Phi (C)\) over \(\mathbb {F}_2[v]/\langle v^2\rangle \), but \(\Phi (C)\) is not a cyclic code in some cases. These properties help us to determine the lower bound and the upper bound for the homogeneous distance of C by discussing the same problem of \(\Phi (C)\). With these bounds, exact homogeneous distances of some \((1+u^2)\)-constacyclic codes are given. On the other hand, we consider the application of homogeneous distances in computing Hamming distances of a class of binary linear quasi-cyclic codes, and derive some optimal binary linear quasi-cyclic codes.
Similar content being viewed by others
References
Hammons, A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Solé, P.: The \(\mathbb{Z}_{4}\)-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40(2), 301–319 (1994)
Shi, M., Zhu, S., Yang, S.: A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb{F}[u]/ <u^m>\). J. Franlkin Inst.-Eng. Appl. Math. 350(5), 929–937 (2013)
Shi, M., Qian, L., Solé, P.: On self-dual negacirculant codes of index two and four. Designs, Codes Cryptogr. 86(11), 2485–2494 (2018)
Shi, M., Denis, K., Solé, P.: A new distance-regular graph of diameter 3 on 1024 vertices. Designs, Codes Cryptogr 87(9), 2091–2101 (2019)
Bonnecaze, A., Udaya, P.: Cyclic codes and self-dual codes over \(\mathbb{F}_2+u\mathbb{F}_2\). IEEE Trans. Inf. Theory 45(4), 1250–1255 (1999)
Qian, J.F., Zhang, L.N., Zhu, S.X.: \((1+u)\) Constacyclic and cyclic codes over \(\mathbb{F}_{2} + u\mathbb{F}_{2}\). Appl. Math. Lett. 19(8), 820–823 (2006)
Abualrub, T., Saip, I.: Cyclic codes over the rings \(\mathbb{Z}_2+u\mathbb{Z}_2\) and \(\mathbb{Z}+u\mathbb{Z}+u^2\mathbb{Z}\). Des. Codes Cryptogr. 42(3), 273–287 (2007)
Al-Ashker, M., Hamoudeh, M.: Cyclic codes over \(\mathbb{Z}_2+u\mathbb{Z}_2+\cdots +u^{k-1}\mathbb{Z}_2\). Turk. J. Math. 35(4), 737–749 (2011)
Singh, A.K., Kewat, P.K.: On cyclic codes over the ring \(\mathbb{Z}_p[u]/\langle u^k\rangle \). Desi. Codes Cryptogr. 74(1), 1–13 (2015)
Abualrub, T., Saip, I.: Constacyclic codes over \(\mathbb{F}_{2} + u\mathbb{F}_{2}\). J. Frankl. Inst. 346(5), 520–529 (2009)
Kai, X., Zhu, S.X., Li, P.: \((1+\lambda u)\)-Constacyclic codes over \(\mathbb{F}_{p}[u]/\langle u^k\rangle \). J. Frankl. Inst. 347(5), 751–762 (2010)
Sobhani, R.: Complete classification of \((\delta +\alpha u^2)\)-constacyclic codes of length \(p^k\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m}\). Finite Fields Their Appl. 34, 123–138 (2015)
Sobhani, R., Sun, Z., Wang, L., Zhu, S. X.: A note on complete classification of \((\delta +\alpha u^2)\)-constacyclic codes of length \(p^k\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}+u^2{\mathbb{F}}_{p^m}\), arXiv:1702.04694V1
Cao, Y., Cao, Y.L., Ma, F.: Complete classification of \((\delta +\alpha u^2)\)-constacyclic codes over \(\mathbb{F}_{2^m}[u]/\langle u^4\rangle \) of oddly even length. Discrete Math. 340(12), 2840–2852 (2017)
Mahmoodi, H.R., Sobhani, R.: On some constacyclic codes over the ring \(\mathbb{F}_{p^m}[u]/\langle u^4\rangle \). Discrete Math. 341(11), 3106–3122 (2018)
Ding, J., Li, H., Liang, J.: \((1+\lambda u^2)\)-constacyclic code of arbitrary length over \(\mathbb{F}_{p^m}[u]/\langle u^3\rangle \). J. Appl. Math. Comput. 59(1–2), 343–359 (2019)
Constaninescu, I.: Lineare Codes über Restklassenringen ganzer Zahlen und ihre Automorphismen bezüglich einer verallgemeinerten Hamming-Metrik (Ph.D. dissertation), Technische University, München, Germany, (1995)
Greferath, M., Schmidt, S.E.: Gray isometries for finite chain rings and a nonlinear Ternary \((36,3^{12},15)\) code. IEEE Trans. Inf. Theory 45(7), 2522–2524 (1999)
Greferath, M., Schmidt, S.E.: Finite ring combinatorics and MacWilliams’s equivalence theorem. J. Comb. Theory Ser. A 92, 17–28 (2000)
Qian, J. F., Zhang, L.N., Zhu, S.X.: Constacyclic and cyclic codes over \({\mathbb{F}}_{2}+u{\mathbb{F}}_{2}+u^2{\mathbb{F}}_{2}\). IEICE Trans. Fundam. E89-A(6), 1863-1865 (2006)
Li, J., Zhang, A., Feng, K.: Linear codes over \(\mathbb{F}_q[x]/\langle x^2\rangle \) and GR\((p^2, m)\) reaching the Griesmer bound. Des. Codes Cryptogr. 86(12), 2837–2855 (2018)
Dinh, H.Q., Dhompongsa, S., Sriboonchitta, S.: Repeated-root constacyclic codes of prime power length over \(\mathbb{F}_{p^m}[u]/\langle u^a\rangle \) and their duals. Discrete Math. 339(6), 1706–1715 (2016)
Han, M., Ye, Y.P., Zhu, S.X., Xu, C., Dou, B.: Cyclic codes over \(R=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+\cdots +u^{k-1}\mathbb{F}_{p^m}\) with length \(p^sn\). Inf. Sci. 181(4), 926–934 (2011)
Dougherty, S.T., Kim, J., Liu, H.: Constructions of self-dual codes over finite commutative chain rings. Int. J. Inf. Coding Theory 1(2), 171–190 (2010)
Grassl, M.: Bound on the minimum distance of linear codes, http://www.codetables.de. Accessed 25 May (2020)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The research is supported by National Natural Science Foundation of China (U1705264 and 61572132), Natural Science Foundation of Fujian Province (2019J01275), Guangxi Key Laboratory of Trusted Software (KX202039), and University Natural Science Research Project of Anhui Province (KJ20180584, KJ2020A0779)
Rights and permissions
About this article
Cite this article
Ding, J., Li, H. & Lin, C. The homogeneous distance of \((1+u^2)\)-constacyclic codes over \(\mathbb {F}_2[u]/\langle u^3\rangle \) and its applications. J. Appl. Math. Comput. 68, 83–100 (2022). https://doi.org/10.1007/s12190-020-01475-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-020-01475-9