Strengthened semidefinite programming bounds for codes

Mathematical Programming

Volumn 109, Issue 2-3, 2007, Pages 239-261

  Laurent, Monique ^a  

^a CWI   (Netherlands)

Author keywords

Binary code; Regular * representation; Semidefinite programming; Stability number; Terwilliger algebra

Indexed keywords

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; POLYNOMIALS;

SEMIDEFINITE PROGRAMMING; STABILITY NUMBERS; TERWILLIGER ALGEBRA;

BINARY CODES;

EID: 33846653263     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0030-3     Document Type: Conference Paper

References (15)

1. De Klerk, E., Pasechnik, D.: A note on the stability number of an orthogonality graph, European Journal of Combinatorics (to appear)
2. 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)
3. Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. [Philips Research Reports Supplements No. 10] Philips Research Laboratories, Eindhoven (1973)
4. Gaterman, K., Parrilo, P.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192, 95-128 (2004)
5. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New York (1988)
6. Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796-817 (2001)
7. Lasserre, J.B.: 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 (2001)
8. Laurent, M.: A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming. Math. Oper. Res. 28(3), 470-496 (2003)
9. Lovász, L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25, 1-7 (1979)
10. Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166-190 (1991)
11. McEliece, R.J., Rodemich, E.R., Rumsey, H.C.: The Lovász' bound and some generalizations. J. Combin. Inform. Syst. Sci. 3, 134-152 (1978)
12. Schrijver, A.: A comparison of the Delsarte and Lovász bounds. IEEE Trans. Inform. Theory 25, 425-429 (1979)
13. Schrijver, A.: New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inform. Theory 51, 2859-2866 (2005)
14. Takesaki, M.: Theory of Operator Algebras I. Springer, Berlin Heidelberg New York (1979)
15. Terwilliger, P.: The subconstituent algebra of an association scheme (Part I). J. Appl. Combin. 1, 363-388 (1992)