Abstract
In this paper, we give a general form of ideals over \(R[X]/\langle f(X)^{p^{s}}\rangle \) when f is a monic irreducible polynomial in R[X] and \(R= \mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+\ldots +u^{n}\mathbb {F}_{p^{m}}\) with un+ 1 = 0. For f(X) = X − 1 this gives a general form of cyclic codes over R. Furthermore, we apply the result to classify completely the cyclic codes of length 5ps over \(\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+u^{2}\mathbb {F}_{p^{m}}\) when p ≡ 2 (mod 5) or p ≡ 3 (mod 5) and m is odd.
Similar content being viewed by others
References
Arnold, A., Monagan, M.: Calculating cyclotomic polynomials. Math. Comput. 80(276), 2359–2379 (2011)
Atiyah, M.: Introduction to commutative algebra, CRC Press (2018)
Brown, W.C.: Matrices Over Commutative Rings. Marcel Dekker Inc., New York (1993)
Cao, Y.: Generalized quasi-cyclic codes over Galois rings: structural properties and enumeration, Applicable Algebra in Engineering. Communication and Computing 22(3), 219–233 (2011)
Charkani, M.E., Boudine, B.: On the integral ideals of R[X] when R is a special principal ideal ring, Sao Paulo. J. Math. Sci. 14(2), 698–702 (2020)
Chen, B., Dinh, H.Q., Liu, H.: Repeated-root constacyclic codes of length lps and their duals. Discret. Appl. Math. 177, 60–70 (2014)
Dinh, H.Q.: Constacyclic codes of length ps over \( \mathbb {F}_{p^{m}} + u \mathbb {F}_{p^{m}}\). J. Algebra 324, 940–950 (2010)
Dinh, H.Q.: Repeated-root constacyclic codes of length 2ps. Finite Fields Appl. 18(1), 133–143 (2012)
Dinh, H.Q.: Structure of repeated-root constacyclic codes of length 3ps and their duals. Discret. Math. 313(9), 983–991 (2013)
Dinh, H.Q.: On repeated-root constacyclic codes of length 4ps. Asian-European Journal of Mathematics 6(02), 1350020 (2013)
Dinh, H.Q., Lopez-Permouth, S.R.: Cyclic and Negacyclic codes over finite chain rings. IEEE Trans. Inform. Theory 50, 1728–1744 (2004)
Dinh, H.Q., Nguyen, H.D.T., Sriboonchitta, S., Vo, T.M.: Repeated-root constacyclic codes of prime power lengths over finite chain rings. Finite Fields Appl. 43, 22–41 (2017)
Kiah, H.M., Leung, K.H., Ling, S.: A note on cyclic codes over GR(p2,m) of length pk, Des. Codes Cryptogr 63, 105112 (2012)
Kiah, H.M., Leung, K.H., Ling, S.: Cyclic codes over GR(p2,m) of length pk. Finite Fields Appl 14, 834846 (2008)
Laaouine, J., Charkani, M.E., Wang, L.: Complete classification of repeated-root σ-constacyclic codes of prime power length over \({\mathbb {F}_{p^{m}}[u]}/{\langle u^{3}\rangle }\). Discret. Math. 344(6), 112325 (2021)
Ling, S., Chaoping, X.: Coding theory: a first course, Cambridge University Press (2004)
Liu, X., Xu, X.: Cyclic and negacyclic codes of length 2ps over \( \mathbb {F}_{p^{m}} + u \mathbb {F}_{p^{m}}\), Acta. Math. Sci. B 34, 829–839 (2014)
Neukirch, J.: Algebraic number theory. Springer Science & Business Media, vol. 322 (2013)
Phuto, J., Klin-Eam, C.: Explicit constructions of cyclic and negacyclic codes of length 3ps over \(\mathbb {F}_{p^{m}}+ u \mathbb {F}_{p^{m}}\), Discrete Mathematics. Algorithms and Applications 12(05), 2050063 (2020)
Prange, E.: Cyclic error-correcting codes in two symbols, air force cambridge research center (1957)
Prange, E.: Some cyclic error-correcting codes with simple decoding algorithms, air force cambridge research Center-TN-58-156, Cambridge, MA (1958)
Sriwirach, W., Klin-eam, C.: Repeated-root constacyclic codes of length 2ps over \(\mathbb F_ p^{m}+ u\mathbb F_ p^{m}+ u^{2}\mathbb F_ p^{m} \). Cryptogr. Commun, pp. 1–26 (2020)
Wu, H., Zhu, L., Feng, R., Yang, S.: Explicit factorizations of cyclotomic polynomials over finite fields. Des. Codes Crypt. 83(1), 197217 (2016)
Acknowledgements
We would like to thank the reviewers and the editors for their time spent on reviewing our manuscript and their comments helping us improving the article. We also thank the doctor Ahmed El Ouadrhiri for his remarks and advice in order to improve our writing style in this paper.
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.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Boudine, B., Laaouine, J. & Charkani, M.E. On the classification of ideals over \(R[X]/\langle f(X)^{p^{s}}\rangle \) when \(R=\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+\ldots +u^{n}\mathbb {F}_{p^{m}}\). Cryptogr. Commun. 15, 589–598 (2023). https://doi.org/10.1007/s12095-022-00620-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-022-00620-4