Spectral approach to linear programming bounds on codes
<|reference_start|>Spectral approach to linear programming bounds on codes: We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal polynomials. The examples of the method considered in the paper include binary codes, binary constant-weight codes, spherical codes, and codes in the projective spaces.<|reference_end|>
@article{barg2005spectral,
    title={Spectral approach to linear programming bounds on codes},
    author={Alexander Barg and Dmitry Nogin},
    journal={Problems of Information Transmission 42, 2, 2006, 77-89},
    year={2005},
    doi={10.1134/S0032946006020025},
    archivePrefix={arXiv},
    eprint={cs/0512025},
    primaryClass={cs.IT math.CO math.IT}
}