An optimal polynomial for a covering radius problem

DOI10.1016/0012-365X(92)90154-8zbMath0756.94016WikidataQ126321776 ScholiaQ126321776MaRDI QIDQ1199501

Jyrki Lahtonen

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Reed-Muller codescovering radiuspolynomialsdual 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)

Related Items (1)

Covering radius and dual distance

Cites Work

• Unnamed Item
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

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