Cargando…
Uniqueness of codes using semidefinite programming
For [Formula: see text] , let A(n, d, w) denote the maximum size of a binary code of word length n, minimum distance d and constant weight w. Schrijver recently showed using semidefinite programming that [Formula: see text] , and the second author that [Formula: see text] and [Formula: see text] . H...
Autores principales: | Brouwer, Andries E., Polak, Sven C. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6743705/ https://www.ncbi.nlm.nih.gov/pubmed/31564772 http://dx.doi.org/10.1007/s10623-018-0589-8 |
Ejemplares similares
-
Semidefinite bounds for nonbinary codes based on quadruples
por: Litjens, Bart, et al.
Publicado: (2016) -
Approximation Algorithms and Semidefinite Programming
por: Gärtner, Bernd, et al.
Publicado: (2012) -
Polyhedral and semidefinite programming methods in combinatorial optimization
por: Tunçel, Levent
Publicado: (2010) -
Handbook of semidefinite programming: theory, algorithms, and applications
por: Wolkowicz, Henry, et al.
Publicado: (2000) -
Chordal graphs and semidefinite optimization
por: Vandenberghe, Lieven, et al.
Publicado: (2015)