On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup>
© 2013 IEEE. Let p be an odd prime, s , m be positive integers such that pm≡ 2 pmod 3. In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all cyclic codes of length 6ps over finite field Fpm is obtain...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Journal |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081651491&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68352 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-68352 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-683522020-04-02T15:27:32Z On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup> Hai Q. Dinh Xiaoqiang Wang Paravee Maneejuk Computer Science Engineering Materials Science © 2013 IEEE. Let p be an odd prime, s , m be positive integers such that pm≡ 2 pmod 3. In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all cyclic codes of length 6ps over finite field Fpm is obtained. All maximum distance separable (MDS) cyclic codes of length 6ps are established. 2020-04-02T15:25:22Z 2020-04-02T15:25:22Z 2020-01-01 Journal 21693536 2-s2.0-85081651491 10.1109/ACCESS.2020.2974866 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081651491&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68352 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Computer Science Engineering Materials Science |
| spellingShingle |
Computer Science Engineering Materials Science Hai Q. Dinh Xiaoqiang Wang Paravee Maneejuk On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup> |
| description |
© 2013 IEEE. Let p be an odd prime, s , m be positive integers such that pm≡ 2 pmod 3. In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all cyclic codes of length 6ps over finite field Fpm is obtained. All maximum distance separable (MDS) cyclic codes of length 6ps are established. |
| format |
Journal |
| author |
Hai Q. Dinh Xiaoqiang Wang Paravee Maneejuk |
| author_facet |
Hai Q. Dinh Xiaoqiang Wang Paravee Maneejuk |
| author_sort |
Hai Q. Dinh |
| title |
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup> |
| title_short |
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup> |
| title_full |
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup> |
| title_fullStr |
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup> |
| title_full_unstemmed |
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup> |
| title_sort |
on the hamming distance of repeated-root cyclic codes of length 6p<sup>s</sup> |
| publishDate |
2020 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081651491&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68352 |
| _version_ |
1681426804522352640 |