On the optimum of Delsarte's linear program

DOI10.1006/jcta.2001.3176zbMath0991.94060OpenAlexW1981075218MaRDI QIDQ5953375

Alex Samorodnitsky

Publication date: 24 August 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2001.3176

zbMATH Keywords

linear programmingbounds on codeserror-correcting code

Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22)

Related Items (7)

Estimates of the distance distribution of codes and designs ⋮ On the high density behavior of Hamming codes with fixed minimum distance ⋮ Difference sets and positive exponential sums. I: General properties ⋮ On metric properties of maps between Hamming spaces and related graph homomorphisms ⋮ Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ Commutative association schemes ⋮ Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube

Cites Work

• On the minimal redundancy of binary error-correcting codes
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• On the distance distribution of codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the optimum of Delsarte's linear program