An optimal polynomial for a covering radius problem

DOI10.1016/0012-365X(92)90154-8MaRDI QIDQ1199501zbMATH OpenWikidataFDO

Authors Jyrki Lahtonen

Publication date 16 January 1993

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomialscovering radiusReed-Muller codesdual distanceFourier-Krawtchouk coefficients

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

• Covering radius---Survey and recent results
• scientific article; zbMATH DE number 1284421
• On the covering radius of binary codes (Corresp.)
• A note on the covering radius of optimum codes
• On the covering radius of codes

Cites work

• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

Cited in

(5)

• Assigning weights to minimize the covering radius in the plane
• Optimal circle covering problems and their applications
• scientific article; zbMATH DE number 910953 (Why is no real title available?)
• scientific article; zbMATH DE number 1057736 (Why is no real title available?)
• Covering radius and dual distance

This page was built for publication: An optimal polynomial for a covering radius problem

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