On the Hamming Distances of Constacyclic Codes of Length 5<italic>p<sup>S</sup></italic>

On the Hamming Distances of Constacyclic Codes of Length 5<italic>p<sup>S</sup></italic>

Let p be a prime, s, m be positive integers, and &#x03BB; be a nonzero element of the finite field F<sub>p(m)</sub>. In this paper, the algebraic structures of constacyclic codes of length 5 p<sup>s</sup> (p &#x2260; 5) are obtained, which provide all self-dual, self-...

Full description

Bibliographic Details
Main Authors: Hai Q. Dinh, Xiaoqiang Wang, Jirakom Sirisrisakulchai
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Constacyclic code
generator polynomial
repeated-root code
simple-root code
Hamming distance
Online Access:https://ieeexplore.ieee.org/document/9016040/

Internet

https://ieeexplore.ieee.org/document/9016040/

Similar Items