On structure and distances of some classes of repeated-root constacyclic codes over Galois rings

DOI10.1016/j.ffa.2016.09.004zbMath1351.94085OpenAlexW2529977461MaRDI QIDQ346282

Songsak Sriboonchitta, Xiu-sheng Liu, Hong-wei Liu, Hai Quang Dinh

Publication date: 5 December 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2016.09.004

zbMATH Keywords

Galois ringsHamming distancecodes over ringsconstacyclic codesdual codeschain ringshomogeneous distancerepeated-root codesRosenbloom-Tsfasman distance

Mathematics Subject Classification ID

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

Related Items (5)

On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring ⋮ Repeated-root constacyclic codes of length $2p^s$ over Galois rings ⋮ MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\) ⋮ Imágenes de Gray de códigos consta-cíclicos sobre anillos de Galois R de índice de nilpotencia 3 ⋮ Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes

Cites Work

• Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
• A metric for codes over residue class rings
• Codes for the \(m\)-metric
• The automorphism group of a linear space with the Rosenbloom-Tsfasman metric
• On the structure of linear and cyclic codes over a finite chain ring
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
• Modular and \(p\)-adic cyclic codes
• Matrix product codes with Rosenbloom-Tsfasman metric
• On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics
• On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
• Repeated-root cyclic and negacyclic codes over a finite chain ring
• On the algebraic structure of quasi-cyclic codes. IV: Repeated roots
• Cyclic codes over \(\mathbb Z_4\) of even length
• Kerdock code in a cyclic form
• A Mass Formula and Rank of<tex>$BBZ_4$</tex>Cyclic Codes of Length<tex>$2^e$</tex>
• On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
• Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
• Cyclic and Negacyclic Codes Over Finite Chain Rings
• Abelian codes over galois rings closed under certain permutations
• Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
• On cyclic MDS codes of length q over GF(q) (Corresp.)
• Semisimple cyclic and Abelian codes. II
• Duality for modules over finite rings and applications to coding theory
• A linear construction for certain Kerdock and Preparata codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
• Fundamentals of Error-Correcting Codes
• Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
• Negacyclic and cyclic codes over Z/sub 4/
• Decoding of linear codes over Galois rings
• Hamming metric decoding of alternant codes over Galois rings
• Decoding a class of Lee metric codes over a Galois ring
• Negacyclic codes over Z/sub 4/ of even length
• Weight distributions of cyclic self-dual codes
• Polynomial weights and code constructions
• On repeated-root cyclic codes
• Repeated-root cyclic codes
• Gröbner bases over Galois rings with an application to decoding alternant codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On structure and distances of some classes of repeated-root constacyclic codes over Galois rings