Semidefinite programming bounds for error-correcting codes
arXiv:1902.01253
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.
arXiv comment17 pages
References in corpus (18)
- New upper bounds on sphere packings I
- New upper bounds for kissing numbers from semidefinite programming
- Commutative association schemes
- Symmetry in semidefinite programs
- Linear programming bounds for codes in Grassmannian spaces
- Upper bounds for packings of spheres of several radii
- 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 proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- Semidefinite programming, harmonic analysis and coding theory
- Semidefinite programming bounds for constant weight codes
- -point semidefinite programming bounds for equiangular lines
- Lecture notes: Semidefinite programs and harmonic analysis
- Block diagonalization for algebra's associated with block codes
- Semidefinite programming bounds for Lee codes
- Semidefinite bounds for mixed binary/ternary codes