scientific article; zbMATH DE number 4108663

MaRDI QIDQ3832464zbMATH OpenFDO

Authors Juriaan Simonis

Publication date 1989

zbMATH Keywords

binary codecovering radiusMacWilliams relationsmultisetparity check matrix

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

• scientific article; zbMATH DE number 1284421
• New lower bounds for covering codes
• scientific article; zbMATH DE number 3965968
• An improved sphere covering bound for the codes with n=3R+2
• Improved sphere bounds on the covering radius of codes

Cited in

(3)

• An improved sphere covering bound for the codes with n=3R+2
• Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere
• On the covering radius of a code and its subcodes

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 Q3832464)