On the covering radius of an unrestricted code as a function of the rate and dual distance

DOI10.1016/S0166-218X(97)00134-0zbMath0904.94029MaRDI QIDQ1383375

Patrick Solé, René Struik, Simon N. Litsyn

Publication date: 25 January 1999

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

linear programmingupper boundsChebyshev polynomialscovering radiusdual distanceMacWilliams transform

Mathematics Subject Classification ID

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

Cites Work

• Some remarks on multivariate Chebyshev polynomials
• Covering radius and dual distance
• On \(r\)-partition designs in Hamming spaces
• On covering radius and discrete Chebyshev polynomials
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• Upper bounds on the covering radius of a code with a given dual distance
• Generalization of the Norse bounds to codes of higher strength
• An upper bound on the covering radius as a function of the dual distance
• Covering radius---Survey and recent results
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On the covering radius of binary codes (Corresp.)
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Covering radius, codimension, and dual-distance width
• Packing radius, covering radius, and dual distance
• Four fundamental parameters of a code and their combinatorial significance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the covering radius of an unrestricted code as a function of the rate and dual distance