A Functional View of Upper Bounds on Codes

DOI10.1142/9789812832245_0002MaRDI QIDQ3614593zbMATH OpenOpenAlexFDO

Authors Alexander Barg, Dmitrii Yu. Nogin

Publication date 9 March 2009

Published in Coding and Cryptology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0809.0091

zbMATH Keywords

Delsarte problemJacobi matrixmoment functionalstationary points

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Linear programming (90C05) Bounds on codes (94B65)

Abstract: Functional and linear-algebraic approaches to the Delsarte problem of upper bounds on codes are discussed. We show that Christoffel-Darboux kernels and Levenshtein polynomials related to them arise as stationary points of the moment functionals of some distributions. We also show that they can be derived as eigenfunctions of the Jacobi operator. This motivates the choice of polynomials used to derive linear programming upper bounds on codes in homogeneous spaces.

Recommendations

• Spectral approach to linear programming bounds on codes
• Bounds for codes by semidefinite programming
• Upper bounds on the minimum distance of spherical codes
• On the optimum of Delsarte's linear program
• On linear programming bounds for codes in polynomial metric spaces

Cited in

(1)

• Spectral approach to linear programming bounds on codes

This page was built for publication: A Functional View of Upper Bounds on Codes

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