Singleton bounds for codes over finite rings

DOI10.1023/A:1008767703006MaRDI QIDQ5926296zbMATH OpenFDO

Authors Keisuke Shiromoto

Publication date 21 February 2002

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1008767703006

zbMATH Keywords

Euclidean weightsgeneral weight functionHamming weightsLee weightsquasi-Froebenius ringSingleton bound

Mathematics Subject Classification ID

Quasi-Frobenius rings (16L60) Bounds on codes (94B65)

Recommendations

• Singleton bounds for R-additive codes
• Singleton's bound in Euclidean codes
• New bounds for codes over finite Frobenius rings
• A singleton bound for linear codes over \(\mathbb{Z}/l\mathbb{Z}\)
• On the equivalence of codes over finite rings
• Singleton-type bounds for blot-correcting codes
• The linear programming bound for codes over finite Frobenius rings
• On bounds for codes over Frobenius rings under homogeneous weights
• On constacyclic codes over finite chain rings
• A Griesmer bound for codes over finite quasi-Frobenius rings

Cites work

• A new MacWilliams type identity for linear codes
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 474654 (Why is no real title available?)
• scientific article; zbMATH DE number 3212917 (Why is no real title available?)
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Über die Identität von MacWilliams für die Gewichtsfunktion von Codes

Cited in

(17)

• Induced weights on quotient modules and an application to error correction in coherent networks
• On bounds for codes over Frobenius rings under homogeneous weights
• Singleton bounds for R-additive codes
• Structure of linear codes over the ring \(B_k\)
• A Griesmer bound for linear codes over finite quasi-Frobenius rings
• Density of free modules over finite chain rings
• Codes over an infinite family of rings with a Gray map
• On maximum Lee distance codes
• Bounds in the Lee metric and optimal codes
• A singleton bound for linear codes over \(\mathbb{Z}/l\mathbb{Z}\)
• A Griesmer bound for codes over finite quasi-Frobenius rings
• Maximum distance codes over rings of order 4
• On the linear codes over the ring Z₄+v₁Z₄+...+v_{t}Z₄
• Some two-weight codes over chain rings and their strongly regular graphs
• MDS and self-dual codes over rings
• A class of locally recoverable codes over finite chain rings
• Better bounds on the minimum Lee distance

This page was built for publication: Singleton bounds for codes over finite rings

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