Good coverings of Hamming spaces with spheres

DOI10.1016/0012-365X(85)90020-2zbMath0579.94017OpenAlexW1967915758MaRDI QIDQ1068057

Peter Frankl, Gérard D. Cohen

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90020-2

zbMATH Keywords

covering radius problemcoverings of associationlinear coveringsschemes by tiles

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

The second-order football-pool problem and the optimal rate of generalized-covering codes ⋮ Frequency computation and bounded queries ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ Write-isolated memories (WIMs) ⋮ On identifying codes in binary Hamming spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the ratio of optimal integral and fractional covers
• A nonconstructive upper bound on covering radius
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• Covering radius---Survey and recent results
• Some 3-error-correcting BCH codes have covering radius 5 (Corresp.)
• On the covering radius of binary codes (Corresp.)
• Four fundamental parameters of a code and their combinatorial significance
• On Communication of Analog Data from a Bounded Source Space

This page was built for publication: Good coverings of Hamming spaces with spheres