Abstract
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n 7) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n 3), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
De Klerk E., Pasechnik, D.: A note on the stability number of an orthogonality graph, European Journal of Combinatorics (to appear)
De Klerk, E., Pasechnik, D., Schrijver, A.: Reduction of symmetric semidefinite programs using the regular ∗-representation. Math. Programm. Ser. B. DOI 10.1007/s10107-006-0039-7 (2006)
Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. [Philips Research Reports Supplements No. 10] Philips Research Laboratories, Eindhoven (1973)
Gaterman K., Parrilo P. (2004) Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192, 95–128
Grötschel M., Lovász L., Schrijver A. (1988) Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New York
Lasserre J.B. (2001) Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796–817
Lasserre J.B. (2001) An explicit exact SDP relaxation for nonlinear 0−1 programs. In: Aardal, K., Gerards, A.M.H., (eds.) Lecture Notes in Computer Science 2081, 293–303
Laurent M. (2003) A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0−1 programming. Math. Oper. Res. 28(3): 470–496
Lovász L. (1979) On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25, 1–7
Lovász L., Schrijver A. (1991) Cones of matrices and set-functions and 0−1 optimization. SIAM J. Optim. 1, 166–190
McEliece R.J., Rodemich E.R., Rumsey H.C. (1978) The Lovász’ bound and some generalizations. J. Combin. Inform. Syst. Sci. 3, 134–152
Schrijver A. (1979) A comparison of the Delsarte and Lovász bounds. IEEE Trans. Inform. Theory 25, 425–429
Schrijver A. (2005) New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inform. Theory 51, 2859–2866
Takesaki M. (1979) Theory of Operator Algebras I. Springer, Berlin Heidelberg New York
Terwilliger P. (1992) The subconstituent algebra of an association scheme (Part I). J. Appl. Combin. 1, 363–388
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.
Rights and permissions
About this article
Cite this article
Laurent, M. Strengthened semidefinite programming bounds for codes. Math. Program. 109, 239–261 (2007). https://doi.org/10.1007/s10107-006-0030-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0030-3