|
Problemy Peredachi Informatsii, 2006, Volume 42, Issue 2, Pages 12–25
(Mi ppi40)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Coding Theory
Spectral Approach to Linear Programming Bounds on
Codes
A. M. Bargab, D. Yu. Nogina a Institute for Information Transmission Problems, Russian Academy of Sciences
b University of Maryland
Abstract:
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. Examples of the
method considered in the paper include binary codes, binary constant-weight codes, spherical
codes, and codes in projective spaces.
Received: 09.12.2005 Revised: 01.03.2006
Citation:
A. M. Barg, D. Yu. Nogin, “Spectral Approach to Linear Programming Bounds on
Codes”, Probl. Peredachi Inf., 42:2 (2006), 12–25; Problems Inform. Transmission, 42:2 (2006), 77–89
Linking options:
https://www.mathnet.ru/eng/ppi40 https://www.mathnet.ru/eng/ppi/v42/i2/p12
|
Statistics & downloads: |
Abstract page: | 587 | Full-text PDF : | 202 | References: | 84 | First page: | 6 |
|