New upper bounds on codes via association schemes and linear programming

DOI10.3934/AMC.2007.1.173MaRDI QIDQ629753zbMATH OpenOpenAlexFDO

Authors Beniamin Mounits, Tuvi Etzion, Simon 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

association schemesbounds on codeslinear programming

Mathematics Subject Classification ID

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

Recommendations

• Improved upper bounds on sizes of codes
• Association schemes and coding theory
• Upper bounds on permutation codes via linear programming
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Strengthened semidefinite programming bounds for codes

Cited in

(9)

• Commutative association schemes
• Upper bounds on permutation codes via linear programming
• 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
• On optimal binary codes with unbalanced coordinates
• A simple proof of the improved Johnson bound for binary codes
• New upper bounds on Enomoto Katona’s coding type problem
• New upper bounds for the size of permutation codes via linear programming

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

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