An improvement of the Van Wee bound for binary linear covering codes

DOI10.1109/18.335936zbMath0813.94023OpenAlexW2135527606MaRDI QIDQ4324204

René Struik

Publication date: 1 March 1995

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

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

zbMATH Keywords

covering radiuslower boundcovering codesbinary linear codesbinary block codes

Mathematics Subject Classification ID

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

Related Items (2)

Memoryless near-collisions via coding theory ⋮ Optimal Covering Codes for Finding Near-Collisions

This page was built for publication: An improvement of the Van Wee bound for binary linear covering codes