Uniqueness of codes using semidefinite programming
Sign Up to like & getrecommendations! Published in 2019 at "Designs, Codes, and Cryptography"
DOI: 10.1007/s10623-018-0589-8
Abstract: For $$n,d,w \in \mathbb {N}$$n,d,w∈N, 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 $$A(23,8,11)=1288$$A(23,8,11)=1288, and the second author that $$A(22,8,11)=672$$A(22,8,11)=672 and $$A(22,8,10)=616$$A(22,8,10)=616.… read more here.
Keywords: uniqueness codes; using semidefinite; codes using; semidefinite programming ... See more keywords