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

DOI10.1109/18.335936MaRDI QIDQ4324204zbMATH OpenOpenAlexFDO

Authors 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

binary block codesbinary linear codescovering codescovering radiuslower bound

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)

Recommendations

• Some new upper bounds on the covering radius of binary linear codes
• Bounds on the covering radius of linear codes
• Improved lower bounds for multicovering codes
• New lower bounds for binary covering codes
• Linear programming bounds for codes via a covering argument
• New upper bounds for binary covering codes
• An improved Bombieri-Weil bound and applications to coding theory
• Lower bounds for binary covering codes
• On covering radius lower bound for a class of binary codes
• On the Covering Dimension of a Linear Code

Cited in

(2)

• Optimal covering codes for finding near-collisions
• Memoryless near-collisions via coding theory

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

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