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...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | دورية |
| منشور في: |
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. |
|---|