On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
From MaRDI portal
Publication:4615366
DOI10.1109/TIT.2018.2864293zbMath1427.94103OpenAlexW2887084797WikidataQ129394899 ScholiaQ129394899MaRDI QIDQ4615366
Publication date: 28 January 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2018.2864293
Related Items (8)
Roulette games and depths of words over finite commutative rings ⋮ Galois LCD codes over rings ⋮ Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\) ⋮ Spinning switches on a wreath product ⋮ LCP of constacyclic codes over finite chain rings ⋮ A characterization of optimal constacyclic locally repairable codes ⋮ Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes ⋮ Further results on higher weights of codes over finite rings
This page was built for publication: On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
