A note on the covering radius of optimum codes

DOI10.1016/0166-218X(91)90104-5zbMath0736.94020OpenAlexW1997012032WikidataQ126324533 ScholiaQ126324533MaRDI QIDQ1180145

M. S. Garg, M. C. Bhandari

Publication date: 27 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90104-5

zbMATH Keywords

upper boundlower boundcovering radius of optimum codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (1)

On the covering radius of Simplex codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum possible block length of a linear binary code for some distances
• Some optimal codes from algebraic geometry and their covering radii
• An improvement of the Griesmer bound for some small minimum distances
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
• On the covering radius of binary, linear codes meeting the Griesmer bound
• On the covering radius of codes
• Covering radius---Survey and recent results
• Further results on the covering radius of codes
• Subcodes and covering radius (Corresp.)
• Some new upper bounds on the covering radius of binary linear codes
• On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
• Weight distributions of the cosets of the (32,6) Reed-Muller code
• A Bound for Error-Correcting Codes
• A note on the Griesmer bound (Corresp.)

This page was built for publication: A note on the covering radius of optimum codes