Structure of some classes of repeated-root constacyclic codes over integers modulo 2ᵐ

zbMATH Open1097.94030MaRDI QIDQ5484172FDOQ5484172

Authors: Hai Quang Dinh 

Publication date: 24 August 2006

Recommendations

• Repeated-root constacyclic codes of length \(2^s\) over \(\mathbb Z_{2^a}\)
• Some classes of repeated-root constacyclic codes over \(\mathbb F_{p^m}+u\mathbb F_{p^m}+u^2\mathbb F_{p^m}\)
• Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)
• A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u] / \langle u^e \rangle\) of type 2
• Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes

zbMATH Keywords

cyclic codesGalois ringsconstacyclic codeslinear codesnegacyclic codeschain ringcodes over finite rings

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Structure of finite commutative rings (13M05) Linear codes (general theory) (94B05) Cyclic codes (94B15) Arithmetic theory of polynomial rings over finite fields (11T55)

Cited In (4)

• On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
• Some constacyclic self-dual codes over the integers modulo \(2^m\)
• On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
• Repeated-root constacyclic codes of length \(2^s\) over \(\mathbb Z_{2^a}\)

This page was built for publication: Structure of some classes of repeated-root constacyclic codes over integers modulo \(2^m\)

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