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: | Hai Q. Dinh, Xiaoqiang Wang, Paravee Maneejuk |
---|---|
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 |
Similar Items
-
On the Hamming distances of repeated-root constacyclic codes of length 4p <sup>s</sup>
by: Hai Q. Dinh, et al.
Published: (2019) -
On the hamming distances of constacyclic codes of length 5p<sup>S</sup>
by: Hai Q. Dinh, et al.
Published: (2020) -
On the symbol-pair distances of repeated-root constacyclic codes of length 2p<sup>s</sup>
by: H. Q. Dinh, et al.
Published: (2019) -
Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup>
by: Hai Q. Dinh, et al.
Published: (2020) -
Repeated-root constacyclic codes of length 3ℓ<sup>m</sup>p<sup>s</sup>
by: Yan Liu, et al.
Published: (2020)