Linear programming bounds for codes of small size
From MaRDI portal
Publication:1367593
DOI10.1006/eujc.1996.0129zbMath0983.94055OpenAlexW1998657826MaRDI QIDQ1367593
Ilia Krasikov, Simon N. Litsyn
Publication date: 21 April 2002
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/26051fbba4b66f23f9ad481728b78ed3991954df
Related Items (2)
Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ Bounds for codes by semidefinite programming
This page was built for publication: Linear programming bounds for codes of small size