On the covering radius of Simplex codes

DOI10.1080/09720529.2003.10697961zbMath1042.94029OpenAlexW2078498792MaRDI QIDQ4440676

No author found.

Publication date: 25 February 2004

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2003.10697961

zbMATH Keywords

covering radiusoptimal codessimplex code\(q\)-ary codes

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (1)

On codes over ℤp2 and its covering radius

Cites Work

• Unnamed Item
• Unnamed Item
• Some optimal codes from algebraic geometry and their covering radii
• A note on the covering radius of optimum codes
• Optimal ternary linear codes
• Optimal linear codes over \(\mathrm{GF}(4)\)
• Design Methods for Maximum Minimum-Distance Error-Correcting Codes
• The Geometry of Two-Weight Codes
• Covering radius---Survey and recent results
• Further results on the covering radius of codes
• Some new upper bounds on the covering radius of binary linear codes
• Optimum codes of dimension 3 and 4 over GF(4)
• Five new optimal ternary linear codes
• Algebraically punctured cyclic codes

This page was built for publication: On the covering radius of Simplex codes