Lower bounds for \(q\)-ary coverings by spheres of radius one

DOI10.1016/0097-3165(94)90013-2zbMath0815.94021OpenAlexW1992996954MaRDI QIDQ1331134

Laurent Habsieger

Publication date: 9 August 1994

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90013-2

zbMATH Keywords

binary codeslower boundsternary codes\(q\)-ary covering codecovering radius onesphere covering bound

Mathematics Subject Classification ID

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

Related Items (4)

Binary codes with covering radius one: Some new lower bounds ⋮ A new lower bound for the football pool problem for 7 matches ⋮ A remark on Haas' method ⋮ A new lower bound for the football pool problem for six matches

Cites Work

• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• Lower bounds for q-ary covering codes
• Covering radius---Survey and recent results
• Further results on the covering radius of codes
• Improved sphere bounds on the covering radius of codes
• The football pool problem for 5 matches
• Note on a theorem of Zaremba
• A Combinatorial Problem in Matching
• Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
• Modified bounds for covering codes
• Covering problems for dichotomized matchings

This page was built for publication: Lower bounds for \(q\)-ary coverings by spheres of radius one