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.2864293zbMATH Open1427.94103OpenAlexW2887084797WikidataQ129394899 ScholiaQ129394899MaRDI QIDQ4615366FDOQ4615366
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
Cited In (10)
- Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes
- Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
- Roulette games and depths of words over finite commutative rings
- Maximum distance separable repeated-root constacyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) with respect to the Lee distance
- Galois LCD codes over rings
- LCP of constacyclic codes over finite chain rings
- Further results on higher weights of codes over finite rings
- A characterization of optimal constacyclic locally repairable codes
- Spinning switches on a wreath product
- 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)
