A nonconstructive upper bound on covering radius

DOI10.1109/TIT.1983.1056678MaRDI QIDQ3337369zbMATH OpenFDO

Authors Gérard Cohen

Publication date 1983

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

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

zbMATH Keywords

covering radius

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Further results on the covering radius of codes
• A new approach to the covering radius of codes
• scientific article; zbMATH DE number 4008282
• On upper bounds for minimum distance and covering radius of non-binary codes
• On covering radius lower bound for a class of binary codes

Cited in

(14)

• Graph pegging numbers
• Good coverings of Hamming spaces with spheres
• A new approach to the covering radius of codes
• A game of prediction with expert advice
• On upper bounds for minimum distance and covering radius of non-binary codes
• Linear codes and character sums
• Optimally pebbling hypercubes and powers
• On covering radius lower bound for a class of binary codes
• Covering the Hamming space with sets translated by linear code vectors
• Multicovering bounds from relative covering radii
• scientific article; zbMATH DE number 4218374 (Why is no real title available?)
• scientific article; zbMATH DE number 4185547 (Why is no real title available?)
• On identifying codes in binary Hamming spaces
• Applications of coding theory to communication combinatorial problems

This page was built for publication: A nonconstructive upper bound on covering radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337369)