Hamming distance of repeated-root constacyclic codes of length 2ps over Fpm + uFpm
Hamming distance of repeated-root constacyclic codes of length 2ps over Fpm + uFpm
Source title:
Applicable Algebra in Engineering, Communication and Computing, 31: 291-305,
2020
(ISI)
Academic year of acceptance:
2020-2021
Abstract:
Let p be an odd prime, and δ be an arbitrary unit of the finite chain ring (u2 = 0). The Hamming distances of all δ-constacyclic codes of length 2ps over
are completely determined. We provide some examples from which some codes have better parameters than the existing ones. As applications, we determine all MDS repeated-root δδ-constacyclic codes of length 2ps over
.