Constacyclic Codes of Length 3<italic>p</italic><sup><italic>s</italic></sup> Over F<italic><sub>p</sub></italic><sup><italic>m</italic></sup> &#x002B; <italic>u</italic>F<italic><sub>p</sub></italic><sup><italic>m</italic></sup> and Their Application in Various Distance Distributions

Constacyclic Codes of Length 3<italic>p</italic><sup><italic>s</italic></sup> Over F<italic><sub>p</sub></italic><sup><italic>m</italic></sup> &#x002B; <italic>u</italic>F<italic><sub>p</sub></italic><sup><italic>m</italic></sup> and Their Application in Various Distance Distributions

Let p &#x2260; 3 be any prime. The structures of all &#x03BB;-constacyclic codes of length 3p<sup>s</sup> over the finite commutative chain ring Fp<sup>m</sup> + uFp<sup>m</sup> (u<sup>2</sup> = 0) are established in the term of their generator...

Full description

Bibliographic Details
Main Authors: Hai Q. Dinh, Bac Trong Nguyen, Woraphon Yamaka
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Repeated-root codes
hamming distance
RT distance
homogeneous distance
Online Access:https://ieeexplore.ieee.org/document/9249409/

Internet

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

Similar Items