On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings

DOI10.1109/TIT.2018.2864293MaRDI QIDQ4615366zbMATH OpenOpenAlexWikidataFDO

Authors Anuradha Sharma, Tania Sidana

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

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited in

(10)

• Roulette games and depths of words over finite commutative rings
• Galois LCD codes over rings
• A characterization of optimal constacyclic locally repairable codes
• Spinning switches on a wreath product
• LCP of constacyclic codes over finite chain rings
• Further results on higher weights of codes over finite rings
• Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes
• Maximum distance separable repeated-root constacyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) with respect to the Lee distance
• Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
• Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\)

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

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