Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup>
© 2020, Springer-Verlag GmbH, DE. Let p be an odd prime, and δ be an arbitrary unit of the finite chain ring Fpm+uFpm(u2=0). The Hamming distances of all δ-constacyclic codes of length 2 ps over Fpm+uFpm are completely determined. We provide some examples from which some codes have better parameters...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Journal |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084139448&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/70711 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | © 2020, Springer-Verlag GmbH, DE. Let p be an odd prime, and δ be an arbitrary unit of the finite chain ring Fpm+uFpm(u2=0). The Hamming distances of all δ-constacyclic codes of length 2 ps over Fpm+uFpm 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 2 ps over Fpm+uFpm. |
|---|