A functional view of upper bounds on codes

Simple item page
dc.creatorBarg, Alexander
dc.creatorNogin, Dmitry
dc.date2008-08-30
dc.date.accessioned2026-07-07T09:59:38Z
dc.date.available2026-07-07T09:59:38Z
dc.descriptionFunctional 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/0809.0091
dc.identifierhttp://arxiv.org/abs/0809.0091
dc.identifier" Coding and Cryptography," Proceedings of the First International Workshop, Wuyi Mountain, Fujian, China, 11 - 15 June 2007, edited by Yongqing Li et al., World Scientific, 2008, pp. 15--24
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168097
dc.subjectInformation Theory
dc.titleA functional view of upper bounds on codes
dc.typetext

Files

Collections

arXiv