Improved sphere bounds on the covering radius of codes

DOI10.1109/18.2632zbMath0653.94014OpenAlexW2116220645MaRDI QIDQ3799949

G. J. M. van Wee

Publication date: 1988

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.2632

zbMATH Keywords

binary codesphere bound

Mathematics Subject Classification ID

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

Related Items (22)

Lower bounds for \(q\)-ary coverings by spheres of radius one ⋮ Independent domination in hypercubes ⋮ The solution to Berlekamp's switching game ⋮ Binary codes with covering radius one: Some new lower bounds ⋮ Random and conditional \((t,k)\)-diagnosis of hypercubes ⋮ On domatic and total domatic numbers of Cartesian products of graphs ⋮ Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ Packings in bipartite prisms and hypercubes ⋮ On the general excess bound for binary codes with covering radius one ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Memoryless near-collisions via coding theory ⋮ On the general excess bound for binary codes with covering radius one ⋮ All binary codes with covering radius one are subnormal ⋮ Frequency computation and bounded queries ⋮ Switching of covering codes ⋮ (Total) domination in prisms ⋮ Bounds for binary multiple covering codes ⋮ Optimal Covering Codes for Finding Near-Collisions ⋮ Upper bounds for football pool problems and mixed covering codes ⋮ On the non-existence of certain perfect mixed codes ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space ⋮ Generalized bounds and binary/ternary mixed packing and covering codes

This page was built for publication: Improved sphere bounds on the covering radius of codes