Paper 2024/730

New Solutions to Delsarte's Dual Linear Programs

André Chailloux, French Institute for Research in Computer Science and Automation
Thomas Debris-Alazard, Inria Saclay - Île-de-France Research Centre
Abstract

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 given minimum distance. Bounding this value can be done by finding solutions to the corresponding dual linear program. Delsarte's theory is very general and goes way beyond binary codes. In this work, we provide universal bounds in the framework of association schemes that generalize the Elias-Bassalygo bound, which can be applied to any association scheme constructed from a distance function. These bounds are obtained by constructing new solutions to Delsarte's dual linear program. We instantiate these results and we recover known bounds for $q$-ary codes and for constant-weight binary codes. Our other contribution is to recover, for essentially any $Q$-polynomial scheme, MRRW-type solutions to Delsarte's dual linear program which are inspired by the Laplacian approach of Friedman and Tillich instead of using the Christoffel-Darboux formulas. We show in particular how the second linear programming bound can be interpreted in this framework.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
Linear Programming BoundsAssociation Schemes
Contact author(s)
andre chailloux @ inria fr
thomas debris @ inria fr
History
2024-05-27: revised
2024-05-13: received
See all versions
Short URL
https://ia.cr/2024/730
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/730,
      author = {André Chailloux and Thomas Debris-Alazard},
      title = {New Solutions to Delsarte's Dual Linear Programs},
      howpublished = {Cryptology ePrint Archive, Paper 2024/730},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/730}},
      url = {https://eprint.iacr.org/2024/730}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.