On repeated-root constacyclic codes of prime power length over polynomial residue rings

DOI10.1090/CONM/642/12887MaRDI QIDQ2977873zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On some classes of constacyclic codes over polynomial residue rings
• Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
• Some classes of repeated-root constacyclic codes over \(\mathbb F_{p^m}+u\mathbb F_{p^m}+u^2\mathbb F_{p^m}\)
• Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
• Repeated-root constacyclic codes of prime power lengths over finite chain rings

Cited in

(3)

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

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)