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...

Descripción completa

Detalles Bibliográficos
Autores principales: Brouwer, Andries E., Polak, Sven C.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2018
Materias:
Article
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

Internet

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