The author studies Delsarte's linear programming approach, which was used by \textit{R. McEliece, E. Rodemich, H. Rumsey}, and \textit{L. Welch} [IEEE Trans. Inf. Theory 23, 157--166 (1977; Zbl 0361.94016)] to get an upper bound for the size of error-correcting codes. The question is whether an even better upper bound can be derived using Delsarte's inequalities. The author arrives at a lower bound for what can be derived; this bound strictly exceeds the Gilbert-Varshamov bound and is at least as big as the average of the Gilbert-Varshamov bound and the McEliece-Rodemich-Rumsey-Welch bound. (In addition to unrestricted binary codes, constant weight codes are also considered in a similar vein.) NEWLINENEWLINENEWLINEOn the other hand, as the author also points out in a note added in proof, recent numerical results by \textit{A. Barg} and \textit{D. Jaffe} [in: Codes and association schemes, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 56, 25--32 (2001; Zbl 0989.94035)] indicate that the McEliece-Rodemich-Rumsey-Welch bound gives (asymptotically) the right answer to Delsarte's linear programming problem, which is not in accordance with the (probably incorrect) main conjecture of the current paper.
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- scientific article; zbMATH DE number 3478749 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 493090 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Numerical results on the asymptotic rate of binary codes
- On the distance distribution of codes
- On the minimal redundancy of binary error-correcting codes
- Linear programming bounds for codes via a covering argument
- Commutative association schemes
- On the Delsarte inequalities
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
- A Functional View of Upper Bounds on Codes
- Sur Une Representation Explicite des Solutions Optimales D'un Programme Lineaire
- scientific article; zbMATH DE number 4085411 (Why is no real title available?)
- A comparison of the Delsarte and Lovász bounds
- The linear programming bound for binary linear codes
- scientific article; zbMATH DE number 729928 (Why is no real title available?)
- scientific article; zbMATH DE number 2077090 (Why is no real title available?)
- Estimates of the distance distribution of codes and designs
- Difference sets and positive exponential sums. I: General properties
- On metric properties of maps between Hamming spaces and related graph homomorphisms
- An Integer Program for Codes
- Unique optima of the Delsarte linear program
- Pseudobinomiality of the sticky random walk
- Loop corrections for hard spheres in Hamming space
- A simple proof of the Delsarte inequalities
- On the high density behavior of Hamming codes with fixed minimum distance
- A characterization of Delsarte's linear programming bound as a ratio bound
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)
