Improved upper bounds on sizes of codes
From MaRDI portal
Publication:4674469
DOI10.1109/18.992776zbMath1061.94083OpenAlexW2116555776MaRDI QIDQ4674469
Tuvi Etzion, Benjamin Mounits, Simon N. Litsyn
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.992776
Related Items
Construction of several classes of maximum codes ⋮ On optimal binary codes with unbalanced coordinates ⋮ Constructing error-correcting binary codes using transitive permutation groups ⋮ New inequalities for \(q\)-ary constant-weight codes ⋮ Semidefinite programming bounds for binary codes from a split Terwilliger algebra ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ The clique distribution in powers of hypercubes ⋮ Fundamentals of coding type problems ⋮ Commutative association schemes
