Abstract
Quasi-polycyclic (QP for short) codes over a finite chain ring R are a generalization of quasi-cyclic codes, and these codes can be viewed as an R[x]-submodule of \({\mathcal {R}}_m^{\ell }\), where \({\mathcal {R}}_m:= R[x]/\langle f\rangle \), and f is a monic polynomial of degree m over R. If f factors uniquely into monic and coprime basic irreducibles, then their algebraic structure allow us to characterize the generator polynomials and the minimal generating sets of 1-generator QP codes as R-modules. In addition, we also determine the parity check polynomials for these codes by using the strong Gröbner bases. In particular, via Magma system, some quaternary codes with new parameters are derived from these 1-generator QP 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. Inform. Theory 40(2), 301–319 (1994)
Alahmadi, A., Dougherty, S., Leroy, A., Solé, P.: On the duality and the direction of polycyclic codes. Adv. Math. Commun. 10(4), 921–929 (2016)
López-Permouth, S.R., Parra-Avila, B.R., Szabo, S.: Dual generalizations of the concept of cyclicity of codes. Adv. Math. Commun. 3(3), 227–234 (2009)
Shi, M., Zhang, Y.: Quasi-twisted codes with constacyclic constituent codes. Finite Fields Appl. 39, 159–178 (2016)
Cao, Y.: \(1\)-generator quasi-cyclic codes over finite chain rings. AAECC 24(1), 53–72 (2013)
Conan, J., Séguin, C.: Structural properties and enumeration of quasi-cyclic codes. AAECC 4(1), 25–39 (1993)
Gao, J., Shen, L., Fu, F.-W.: Bounds on quasi-cyclic codes over finite chain rings. J. Appl. Math. Comput. 50(1), 577–587 (2016)
Gao, J., Shen, L.: A class of \(1\)-generator quasi-cyclic codes over finite chain rings. Int. J. Comput. Math. 93(1), 40–54 (2016)
Ling, S., Solé, P.: On the algebraic structure of quasi-cyclic codes II: chain rings. Des. Codes Cryptogr. 30(1), 113–130 (2003)
Ling, S., Solé, P.: Good self-dual quasi-cyclic codes exist. IEEE Trans. Inform. Theory 49(4), 1052–1053 (2003)
Shi, M., Özbudak, F., Xu, L., Solé, P.: LCD codes from tridiagonal Toeplitz matrices. Finite Fields Appl. 75, 101892 (2021)
Shi, M., Li, X., Sepasdar, Z., Solé, P.: Polycyclic codes as invariant subspaces. Finite Fields Appl. 68, 101760 (2020)
Fotue-Tabue, A., Martíez-Moro, E., Blackford, J.T.: On polycyclic codes over a finite chain ring. Adv. Math. Commun. 14(3), 455–466 (2020)
López-Permouth, S.R., Özadam, H., Özbudak, F., Szabo, S.: Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes. Finite Fields Appl. 19(1), 16–38 (2013)
Wu, R., Shi, M.: On \({\mathbb{Z}}_2{\mathbb{Z}}_4\)-additive polycyclic codes and their Gray images. Des. Codes Cryptogr. (2021). https://doi.org/10.1007/s10623-021-00917-0
Beenker, G.F.M.: On double circulant codes, Rep. 80-WSK-04, Dep. Math., Technol. Univ. Eindhoven, The Netherlands, (1980)
Shi, M., Qian, L., Solé, P.: On self-dual negacirculant codes of index two and four. Des. Codes Cryptogr. 86(11), 2485–2494 (2018)
Shi, M., Zhu, H., Qian, L., Sok, L., Solé, P.: On self-dual and LCD double circulant and double negacirculant codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\). Cryptogr. Commun. 12(1), 53–70 (2020)
Shi, M., Xu, L., Solé, P.: Construction of isodual codes from polycirculant matrices. Des. Codes Cryptogr. 88(12), 2547–2560 (2020)
Gulliver, T.A.: Optimal double circulant self-dual codes over \({\mathbb{F}}_4\). IEEE Trans. Inform. Theory 46(1), 271–274 (2000)
Alahmadi, A., Ödemir, F., Solé, P.: On self-dual double circulant codes. Des. Codes Cryptogr. 86(6), 1257–1265 (2018)
Huang, D., Shi, M., Solé, P.: Double circulant self-dual and LCD codes over \({\mathbb{Z}}_{p^2}\). Int. J. Found. Comput. S. 30(3), 407–416 (2019)
Shi, M., Huang, D., Sok, L., Solé, P.: Double circulant LCD codes over \({\mathbb{Z}}_4\). Finite Fields Appl. 34, 133–144 (2019)
Shi, M., Qian, L., Sok, L., Aydin, N., Solé, P.: On constacyclic codes over \({\mathbb{Z}}_4[u]/\langle u^2-1\rangle \) and their Gray images. Finite Fields Appl. 45, 86–95 (2017)
Gao, Y., Gao, J., Wu, T., Fu, F.-W.: 1-generator quasi-cyclic and generalized quasi-cyclic codes over the ring \(\frac{{\mathbb{Z}}_4[u]}{\langle u^2-1\rangle }\). AAECC 28(6), 457–467 (2017)
Bandi, R., Bhaintwal, M., Aydin, N.: A mass formula for negacyclic codes of length \(2^k\) and some good negacyclic codes over \({\mathbb{Z}}_4+u{\mathbb{Z}}_4\). Cryptogr. Commun. 9(2), 241–272 (2017)
Özen, M., Uzekmek, F., Aydin, N.: Cyclic and some constacyclic codes over the ring \({\mathbb{Z}}_4[u]/\langle u^2-1\rangle \). Finite Fields Appl. 38, 27–39 (2016)
Wu, T., Gao, J., Fu, F.-W.: 1-generator generalized quasi-cyclic codes over \({\mathbb{Z}}_4\). Cryptogr. Commun. 9(2), 291–299 (2015)
Aydin, N., Asamov, T.: The \({\mathbb{Z}}_4\) Database [Online]. Available: http://z4codes.info/. accessed on 28.08.2015
Cao, Y., Cao, Y., Dougherty, S., Ling, S.: Construction and enumeration for self-dual cyclic codes over \({\mathbb{Z}}_4\) of oddly even length. Des. Codes Cryptogr. 87(10), 2419–2446 (2019)
Norton, G.H., Sǎlǎgean, A.: Strong Gröbner basis for polynomials over a principal ideal ring. Bull. Austral. Math. Soc. 64(3), 505–528 (2001)
Sǎlǎgean, A.: Repeated-root cyclic and negacyclic codes over a finite chain ring. Discrete Applied Math. 154(2), 413–419 (2006)
Norton, G.H., Sǎlǎgean, A.: Cyclic codes and minimal strong Gröbner basis over a principal ideal ring. Finite Fields Appl. 9, 237–249 (2003)
Calderbank, A.R., Sloane, A.R.: Modular and \(p\)-adic codes. Des. Codes Cryptogr. 6(1), 21–35 (1995)
Norton, G.H., Sǎlǎgean, A.: On the structure of linear and cyclic codes over a finite chain ring. AAECC 10(6), 489–506 (2000)
Hou, X., López-Permouth, S.R., Parra-Avila, B.: Rational power series, sequential codes and periodicity of sequences. J. Pure Appl. Algebra 213(6), 1157–1169 (2009)
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symbolic Comput. 24, 235–265 (1997)
Acknowledgements
The authors would like to thank the anonymous referees for their careful checking and helpful suggestions which have improved the manuscript. The authors are also grateful to the Assoc. Prof. Edgar Martínez-Moro for helpful discussions.
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.
This research is supported by the National Natural Science Foundation of China (12071001), the Excellent Youth Foundation of Natural Science Foundation of Anhui Province (1808085J20).
Rights and permissions
About this article
Cite this article
Wu, R., Shi, M. & Solé, P. On the structure of 1-generator quasi-polycyclic codes over finite chain rings. J. Appl. Math. Comput. 68, 3491–3503 (2022). https://doi.org/10.1007/s12190-021-01669-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-021-01669-9
Keywords
- Polycyclic codes
- Sequential codes
- 1-generator quasi-polycyclic codes
- Duality
- \({\mathbb {Z}}_4\)-linear codes