New upper bounds on codes via association schemes and linear programming

DOI10.3934/AMC.2007.1.173zbMath1207.94087OpenAlexW2092900268MaRDI 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

zbMATH Keywords

linear programmingassociation schemesbounds on codes

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65)

Related Items (6)

Two-weight and three-weight linear codes constructed from Weil sums ⋮ 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 ⋮ Improved linear programming bound on sizes of doubly constant-weight codes ⋮ Commutative association schemes

This page was built for publication: New upper bounds on codes via association schemes and linear programming