New upper bounds on codes via association schemes and linear programming
From MaRDI portal
Publication:629753
DOI10.3934/amc.2007.1.173zbMath1207.94087MaRDI QIDQ629753
Tuvi Etzion, Beniamin Mounits, Simon N. Litsyn
Publication date: 10 March 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2007.1.173
Related Items
A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES, On optimal binary codes with unbalanced coordinates, Commutative association schemes, Improved linear programming bound on sizes of doubly constant-weight codes, Two-weight and three-weight linear codes constructed from Weil sums, Constructing error-correcting binary codes using transitive permutation groups