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 |
| id |
th-cmuir.6653943832-70711 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-707112020-10-14T08:39:45Z Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup> Hai Q. Dinh A. Gaur Indivar Gupta Abhay K. Singh Manoj Kumar Singh Roengchai Tansuchat Mathematics © 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. 2020-10-14T08:39:45Z 2020-10-14T08:39:45Z 2020-06-01 Journal 09381279 2-s2.0-85084139448 10.1007/s00200-020-00432-0 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084139448&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/70711 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| continent |
Asia |
| country |
Thailand Thailand |
| content_provider |
Chiang Mai University Library |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics Hai Q. Dinh A. Gaur Indivar Gupta Abhay K. Singh Manoj Kumar Singh Roengchai Tansuchat Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup> |
| description |
© 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. |
| format |
Journal |
| author |
Hai Q. Dinh A. Gaur Indivar Gupta Abhay K. Singh Manoj Kumar Singh Roengchai Tansuchat |
| author_facet |
Hai Q. Dinh A. Gaur Indivar Gupta Abhay K. Singh Manoj Kumar Singh Roengchai Tansuchat |
| author_sort |
Hai Q. Dinh |
| title |
Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup> |
| title_short |
Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup> |
| title_full |
Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup> |
| title_fullStr |
Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup> |
| title_full_unstemmed |
Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup> |
| title_sort |
hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over f<sup>pm</sup>+uf<sup>pm</sup> |
| publishDate |
2020 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084139448&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/70711 |
| _version_ |
1681752952326324224 |