A table of upper bounds for binary codes

DOI10.1109/18.959279MaRDI QIDQ4544744zbMATH OpenOpenAlexFDO

Authors Erik Agrell, Alexander Vardy, 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)

Recommendations

• Bounds for binary codes of length less than 25
• Improved upper bounds on sizes of codes
• A new upper bound for binary codes with minimum distance four
• Upper bounds for constant-weight codes
• scientific article; zbMATH DE number 7274073

Cited in

(15)

• The packing chromatic number of hypercubes
• A new upper bound for binary codes with minimum distance four
• Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
• Two new four-error-correcting binary codes
• Constructing error-correcting binary codes using transitive permutation groups
• The sextuply shortened binary Golay code is optimal
• On optimal binary codes with unbalanced coordinates
• The clique distribution in powers of hypercubes
• An updated table of minimum-distance bounds for binary linear codes
• A simple proof of the improved Johnson bound for binary codes
• New lower bounds on \(q\)-ary error-correcting codes
• Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
• A new upper bound for single error-correcting codes
• scientific article; zbMATH DE number 6004916 (Why is no real title available?)
• Packing coloring of hypercubes with extended Hamming codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544744)