Multicovering bounds from linear inequalities

MaRDI QIDQ2741392zbMATH OpenFDO

Authors Andrew Klapper

Publication date 14 October 2001

zbMATH Keywords

covering radiusmulticovering radii

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• Balancing sets of vectors
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 874507 (Why is no real title available?)
• Improved lower bounds for multicovering codes
• Linear inequalities for covering codes. I. Pair covering inequalities
• The multicovering radii of codes

Cited in

(5)

• Facets of a mixed-integer bilinear covering set with bounds on variables
• Improved Multicovering Bounds From Linear Inequalities and Supercodes
• Inequalities for covering 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: Multicovering bounds from linear inequalities

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