On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6<italic>p<sup>s</sup></italic>
Let p be an odd prime, s, m be positive integers such that p<sup>m</sup> = 2 (mod 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 6p<sup>s</sup&g...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9001011/ |