A nonconstructive upper bound on covering radius

DOI10.1109/TIT.1983.1056678zbMath0545.94010MaRDI QIDQ3337369

Gérard D. Cohen

Publication date: 1983

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

zbMATH Keywords

covering radius

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items

Applications of coding theory to communication combinatorial problems ⋮ On identifying codes in binary Hamming spaces ⋮ A game of prediction with expert advice ⋮ Graph pegging numbers ⋮ Optimally pebbling hypercubes and powers ⋮ Good coverings of Hamming spaces with spheres