Equivalence Classes and Structures of Constacyclic Codes Over Finite Fields

DOI10.1090/conm/642/12886zbMath1360.94366OpenAlexW4235357411MaRDI QIDQ2977872

Bocong Chen, Hai Quang Dinh

Publication date: 20 April 2017

Published in: Algebra for Secure and Reliable Communication Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/642/12886

zbMATH Keywords

isometrycyclic codesconstacyclic codesdual codeschain ringscyclotomic cosetsnegacyclic codesrepeated-root codescodes over finite fieldscodes over finite chain rings

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (3)

Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u}{\langle u^a \rangle}\) and their duals] ⋮ On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) ⋮ On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)

This page was built for publication: Equivalence Classes and Structures of Constacyclic Codes Over Finite Fields