Semidefinite programming bounds for error-correcting codes

Abstract

This chapter is written for the forthcoming book "A Concise Encyclopedia of Coding Theory" (CRC press), edited by W. Cary Huffman, Jon-Lark Kim, and Patrick Solé. This book will collect short but foundational articles, emphasizing definitions, examples, exhaustive references, and basic facts on the model of the Handbook of Finite Fields. The target audience of the Encyclopedia is upper level undergraduates and graduate students.

17 pages

References in corpus (12)

• New upper bounds for kissing numbers from semidefinite programming
• Symmetry in semidefinite programs
• On the Turing model complexity of interior point methods for semidefinite programming
• A semidefinite programming hierarchy for packing problems in discrete geometry
• Semidefinite bounds for nonbinary codes based on quadruples
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• $k$-point semidefinite programming bounds for equiangular lines
• Semidefinite programming bounds for constant weight codes
• Lecture notes: Semidefinite programs and harmonic analysis
• Block diagonalization for algebra's associated with block codes
• Semidefinite bounds for mixed binary/ternary codes
• Semidefinite programming bounds for Lee codes