Equivalence classes and structures of constacyclic codes over finite fields
DOI10.1090/CONM/642/12886zbMATH Open1360.94366OpenAlexW4235357411MaRDI QIDQ2977872FDOQ2977872
Authors: 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
Recommendations
cyclic codesisometrychain ringsconstacyclic codesdual codescyclotomic cosetsnegacyclic codesrepeated-root codescodes over finite fieldscodes over finite chain rings
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cited In (15)
- Switching equivalence classes of perfect codes
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Constacyclic codes over finite fields
- A class of constacyclic codes over a finite field
- On the equivalence of linear cyclic and constacyclic codes
- On the nonperiodic cyclic equivalence classes of Reed-Solomon codes
- On isometry and equivalence of skew constacyclic codes
- An equivalence based classification of [6, 3, 4] error correcting codes over GF(5)
- Constacyclic codes as invariant subspaces
- δ-dual codes over finite commutative semi-simple rings
- Isometries of the Hamming Space and Equivalence Relations of Linear Codes Over a Finite Field
- On the nonperiodic cyclic equivalance classes of Hamming codes and BCH codes
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- A class of constacyclic codes from group algebras
This page was built for publication: Equivalence classes and structures of constacyclic codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977872)
