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: | , , |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2020
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081651491&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68352 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | © 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. |
|---|