Improved lower bounds for multicovering codes

DOI10.1109/18.796398MaRDI QIDQ4503441zbMATH OpenOpenAlexFDO

Authors Andrew Klapper

Publication date 7 September 2000

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

Full work available at URL https://semanticscholar.org/paper/da8ab495deeda1c0ebfbabeb0d7b49555374c81a

zbMATH Keywords

\(m\)-covering radiuserror-correcting codeslower boundsmulticovering radius

Mathematics Subject Classification ID

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

Recommendations

• The multicovering radii of codes
• Multicovering bounds from relative covering radii
• Multicovering bounds from linear inequalities
• Improved Multicovering Bounds From Linear Inequalities and Supercodes
• scientific article; zbMATH DE number 2109039

Cited in

(10)

• The multicovering radius problem for some types of discrete structures
• Multicovering bounds from linear inequalities
• Improved Multicovering Bounds From Linear Inequalities and Supercodes
• An improvement of the Van Wee bound for binary linear covering codes
• The multicovering radii of codes
• Improving Error Bounds for Multipole-Based Treecodes
• Improved upper bounds on sizes of codes
• Improved bounds for the rate loss of multiresolution source codes
• scientific article; zbMATH DE number 2109039 (Why is no real title available?)
• Modified bounds for covering codes

This page was built for publication: Improved lower bounds for multicovering codes

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