New Solutions to Delsarte's Dual Linear Programs

ePrint Report: New Solutions to Delsarte's Dual Linear Programs

André Chailloux, Thomas Debris-Alazard

Understanding the maximum size of a code with a given minimum distance is a major question in computer science and discrete mathematics. The most fruitful approach for finding asymptotic bounds on such codes is by using Delsarte's theory of association schemes. With this approach, Delsarte constructs a linear program such that its maximum value is an upper bound on the maximum size of a code with a …

code computer computer science eprint report linear major mathematics question report science size solutions theory thomas understanding