On Repeated-Root Constacyclic Codes of Prime Power Length Over Polynomial Residue Rings

DOI10.1090/CONM/642/12887zbMATH Open1360.94399OpenAlexW4234210230MaRDI QIDQ2977873FDOQ2977873

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/12887

zbMATH Keywords

Hamming distanceGalois ringschain ringsconstacyclic codesdual codeshomogeneous distancepolynomial residue rings

Mathematics Subject Classification ID

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

Cited In (2)

• Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
• On some classes of constacyclic codes over polynomial residue rings

This page was built for publication: On Repeated-Root Constacyclic Codes of Prime Power Length Over Polynomial Residue Rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977873)