Improved Multicovering Bounds From Linear Inequalities and Supercodes

DOI10.1109/TIT.2004.825504MaRDI QIDQ3547165zbMATH OpenFDO

Authors Andrew Klapper

Publication date 21 December 2008

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

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

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

• Multicovering bounds from linear inequalities
• Improved lower bounds for multicovering codes
• Multicovering bounds from relative covering radii
• The multicovering radii of codes
• Lower bounds on t(n, k) from linear inequalities

Cited in

(5)

• ZNN for solving online time-varying linear matrix-vector inequality via equality conversion
• Multicovering bounds from linear inequalities
• The multicovering radii of codes
• Improved lower bounds for multicovering codes
• scientific article; zbMATH DE number 2109039 (Why is no real title available?)

This page was built for publication: Improved Multicovering Bounds From Linear Inequalities and Supercodes

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