Lee distance distribution of repeated-root constacyclic codes over GR(2e,m) and related MDS codes

DOI10.1007/S12190-021-01694-8MaRDI QIDQ2103108zbMATH OpenOpenAlexFDO

Authors Pramod Kumar Kewat, Nilay Kumar Mondal, Hai Quang Dinh

Publication date 13 December 2022

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12190-021-01694-8

zbMATH Keywords

constacyclic codesMDS codesrepeated-root codesLee distancecodes over Galois rings

Mathematics Subject Classification ID

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

Recommendations

• Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
• Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
• The Hamming distances of negacyclic codes of length 2s over GR (2a , m )
• Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
• Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes

Cites work

• scientific article; zbMATH DE number 3477028 (Why is no real title available?)
• scientific article; zbMATH DE number 2002850 (Why is no real title available?)
• A generalization of the Lee weight to \(\mathbb Z_{p^k}\)
• Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
• Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
• Lee weights of cyclic self-dual codes over Galois rings of characteristic \(p^2\)
• Lee-metric BCH codes and their application to constrained and partial-response channels
• Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
• On quasi-cyclic codes over \({\mathbb{Z}_q}\)
• On some classes of repeated-root constacyclic codes of length a power of 2 over Galois rings
• On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
• On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
• On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
• On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
• Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)
• Repeated root cyclic \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
• Repeated-root constacyclic codes of prime power lengths over finite chain rings
• Some Repeated-Root Constacyclic Codes Over Galois Rings
• Some constacyclic codes over finite chain rings
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Z/sub 2/k-linear codes

Cited in

(2)

• Maximum distance separable repeated-root constacyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) with respect to the Lee distance
• Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)

This page was built for publication: Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes

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