MDR codes over Z/sub k/

DOI10.1109/18.817524zbMath1001.94039OpenAlexW1993686816MaRDI QIDQ4503511

Shiromoto, Keisuke, Steven T. Dougherty

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.817524

zbMATH Keywords

codes over ringsChinese remainder theoremmaximum distancerank codesfree code

Mathematics Subject Classification ID

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

Related Items (20)

On abelian codes over \(\mathbb {Z}_m\) ⋮ Type II codes over finite rings ⋮ On modular cyclic codes ⋮ Identification of proteins by the use of Chinese remainder theorem codes over finite commutative rings ⋮ Construction of self-dual codes over finite rings \(\mathbb Z_{p^m}\) ⋮ The weight distribution of codes over finite chain rings ⋮ Matrix graphs and MRD codes over finite principal ideal rings ⋮ Bounds in the Lee metric and optimal codes ⋮ Higher weights for codes over rings ⋮ Construction of self-dual MDR cyclic codes over finite chain rings ⋮ Negacyclic self-dual codes over finite chain rings ⋮ Generalized bilinear forms graphs and MRD codes over a residue class ring ⋮ Codes over the \(p\)-adic integers ⋮ Cyclic codes over the ring \(\mathrm{GR}(p^e, m) [u / \langle u^k \rangle \)] ⋮ MDS codes over finite principal ideal rings ⋮ Modular independence and generator matrices for codes over \(\mathbb{Z}_m\) ⋮ Construction of MDS self-dual codes over Galois rings ⋮ Lifted codes and their weight enumerators ⋮ On the linear codes over the ring Z₄+v₁Z₄+...+v_{t}Z₄ ⋮ Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets

This page was built for publication: MDR codes over Z/sub k/