Abstract
Let \({\mathcal{R}}\) be the finite chain ring \({\mathcal{R}}={\mathbb{F}}_{p^{m}}+ u{\mathbb{F}}_{p^{m}}(u^{2} = 0)\), where p is an odd prime number and m is a positive integer. For \(\eta \in {\mathbb{F}}_{p^{m}}^{*}\), the Hamming distances of all \(\eta\)-constacyclic codes of length \(2p^{s}\) over \({\mathcal{R}}\) had already been studied in Dinh et al. (in AAECC, 2020. https://doi.org/10.1007/s00200-020-00432-0). However, such a study is incomplete. In this paper, we provide corrections to some results that appeared in Dinh et al. (2020) and we completely solve the problem of determination of the Hamming distance of \(\eta\)-constacyclic codes of length \(2p^{s}\) over \({\mathcal{R}}\).
Similar content being viewed by others
References
Chen, B., Dinh, H.Q., Liu, H., Wang, L.: Constacyclic codes of length \(2p^{s}\) over \({{\mathbb{F}}}_{p^{m}}+ u {{\mathbb{F}}}_{p^{m}}\). J. Finite Fields Appl. 37(Issue Issue C), 108–130 (2016)
Dinh, H.Q., Gaur, A., Gupta, I., et al.: Hamming distance of repeated-root constacyclic codes of length \(2p^{s}\) over \({\mathbb{F}}_{p^{m}}+ u {\mathbb{F}}_{p^{m}}\). AAECC (2020). https://doi.org/10.1007/s00200-020-00432-0
Dinh, H.Q., Nguyen, B.T., Singh, A.K., Sriboonchitta, S.: Hamming and symbol pair distances of repeated root constacycliccodes of prime power lengths over \({\mathbb{F}}_{p^m}+ u {\mathbb{F}}_{p^m}\). IEEE Trans. Inf. Theory 64(4), 24174–2430 (2018)
Laaouine, J.: On the Hamming and symbol-pair distance of constacyclic codes of length \(p^s\) over \({{\mathbb{F}}}_{p^m}+ u{{\mathbb{F}}}_{p^m}\). In: International Conference on Advanced Communication Systems and Information Security, pp. 137–154. Springer, Cham (2019)
Lopez-Permouth, S.R., Ozadam, H., Ozbudak, F., Szabo, S.: Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes. Finite Fields Appl. 19, 164–38 (2013)
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
About this article
Cite this article
Laaouine, J., Charkani, M.E. A note on “H. Q. Dinh et al., Hamming distance of repeated-root constacyclic codes of length \(2p^{s}\) over \({\mathbb{F}}_{p^{m}}+ u{\mathbb{F}}_{p^{m}}\)”. AAECC 34, 157–163 (2023). https://doi.org/10.1007/s00200-021-00492-w
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-021-00492-w