New code upper bounds from the Terwilliger algebra and semidefinite programming

IEEE Transactions on Information Theory

Volumn 51, Issue 8, 2005, Pages 2859-2866

  Schrijver, Alexander ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Block diagonalization; Codes; Constant weight codes; Delsarte bound; Semidefinite programming; Terwilliger algebra; Upper bounds

Indexed keywords

MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; POLYNOMIALS; TENSORS;

BLOCK DIAGONALIZATION; CONSTANT WEIGHT CODES; DELSARTE BOUND; SEMIDEFINITE PROGRAMMING; TERWILLIGER ALGEBRA; UPPER BOUNDS;

BINARY CODES;

EID: 23844454333     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.851748     Document Type: Article

References (17)

1. E. Agrell, A. Vardy, and K. Zeger, "Upper bounds for constant-weight codes," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2373-2395, Nov. 2000.
2. E. Agrell, A. Vardy, and K. Zeger, "A table of upper bounds for binary codes," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 3004-3006, Nov. 2001.
3. M. R. Best, A. E. Brouwer, F. J. MacWilliams, A. M. Odlyzko, and N. J. A. Sloane, "Bounds for binary codes of length less than 25," IEEE Trans. Inf. Theory, vol. IT-24, no. 1, pp. 81-93, Jan. 1978.
4. P. Delsarte, "An algebraic approach to the association schemes of coding theory," Philips Res. Repts. Suppl., no. 10, 1973.
5. K. Elssel and K.-H. Zimmermann, "Two new nonlinear binary codes," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 1189-1190, Mar. 2005.
6. J. T. Go, "The Terwilliger algebra of the hypercube," Europ. J. Combin, vol. 23, pp. 399-429, May 2002.
7. L. Lovász, "On the Shannon capacity of a graph," IEEE Trans. Inf. Theory, vol. IT-25, no. 1, pp. 1-7, Jan. 1979.
8. L. Lovász and A. Schrijver, "Cones of matrices and set-functions and 0-1 optimization," SIAM J. Optim., vol. 1, pp. 166-190, May 1991.
9. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
10. R. J. McEliece, E. R. Rodemich, and H. C. Rumsey Jr, "The Lovász bound and some generalizations," J. Combin. Inf. System Sci., vol. 3, no. 3, pp. 134-152, 1978.
11. B. Mounits, T. Etzion, and S. Litsyn, "Improved upper bounds on sizes of codes," IEEE Trans. Inf. Theory, vol. 48, no. 4, pp. 880-886, Apr. 2002.
12. P. R. J. Östergård. (2003) Two New Four-Error-Correcting Binary Codes. [Online]. Available: http://www.hut.fi/~pat/papers/four.ps
13. A. Schrijver, "A comparison of the Delsarte and Lovász bounds," IEEE Trans. Inf. Theory, vol. IT-25, no. 4, pp. 425-429, Jul. 1979.
14. P. Terwilliger, "The subconstituent algebra of an association scheme (Part I)," J. Algebraic Combin., vol. 1, pp. 363-388, Dec. 1992.
15. M. J. Todd, "Semidefinite optimization," Acta Numer., vol. 10, pp. 515-560, May 2001.
16. R. H. Tütüncü, K. C. Toh, and M. J. Todd, "Solving semidefinite-quadratic-linear programs using SDPT3," Math. Program., ser. B, vol. 95, pp. 189-217, Feb. 2003.
17. S. J. Wright, "Nonlinear and semidefinite programming," in Trends in Optimization. Proc. Symp. Appl. Math., vol. 61, Providence, RI, 2004, pp. 115-137.