On the optimum of Delsarte's linear program

DOI10.1006/JCTA.2001.3176zbMATH Open0991.94060OpenAlexW1981075218MaRDI QIDQ5953375FDOQ5953375

Authors: 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

Recommendations

• The linear programming bound for binary linear codes
• Linear programming bounds for codes via a covering argument
• Numerical results on the asymptotic rate of binary codes
• Linear programming bounds for codes of small size
• Spectral approach to linear programming bounds on codes

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the distance distribution of 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
• Numerical results on the asymptotic rate of binary codes
• On the minimal redundancy of binary error-correcting codes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (18)

• Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
• A comparison of the Delsarte and Lovász bounds
• Title not available (Why is that?)
• A simple proof of the Delsarte inequalities
• A characterization of Delsarte's linear programming bound as a ratio bound
• The linear programming bound for binary linear codes
• On the high density behavior of Hamming codes with fixed minimum distance
• Unique optima of the Delsarte linear program
• Title not available (Why is that?)
• Sur Une Representation Explicite des Solutions Optimales D'un Programme Lineaire
• Estimates of the distance distribution of codes and designs
• Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
• Difference sets and positive exponential sums. I: General properties
• Title not available (Why is that?)
• Commutative association schemes
• On metric properties of maps between Hamming spaces and related graph homomorphisms
• Linear programming bounds for codes via a covering argument
• A Functional View of Upper Bounds on Codes

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

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