A table of upper bounds for binary codes

DOI10.1109/18.959279zbMath1003.94045OpenAlexW2168946262MaRDI QIDQ4544744

Alexander Vardy, Erik Agrell, Kenneth Zeger

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.959279

zbMATH Keywords

linear programmingupper boundsbinary codesconstant-weight codesDelsarte inequality

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (10)

Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems ⋮ On optimal binary codes with unbalanced coordinates ⋮ Constructing error-correcting binary codes using transitive permutation groups ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ The sextuply shortened binary Golay code is optimal ⋮ The clique distribution in powers of hypercubes ⋮ Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ Two new four-error-correcting binary codes ⋮ The packing chromatic number of hypercubes

This page was built for publication: A table of upper bounds for binary codes