scientific article; zbMATH DE number 910954

MaRDI QIDQ4886131zbMATH OpenFDO

Authors Gilles Zémor

Publication date 28 July 1996

zbMATH Keywords

binary linear codesboundscovering radius

Mathematics Subject Classification ID

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

Recommendations

• On the covering radius of codes
• scientific article; zbMATH DE number 1284421
• Bounds on the covering radius of linear codes
• Extremal self-dual codes with the smallest covering radius
• scientific article; zbMATH DE number 1024657

Cited in

(8)

• The covering radius of extreme binary 2-surjective codes
• Subset sums in binary spaces
• Estimating the size of correcting codes using extremal graph problems
• On the covering radius of binary codes (Corresp.)
• scientific article; zbMATH DE number 1996483 (Why is no real title available?)
• scientific article; zbMATH DE number 1522570 (Why is no real title available?)
• On the size of optimal binary codes of length 9 and covering radius 1
• An extremum problem for polynomials and bounds for codes with given distance and diameter

This page was built for publication:

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