Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Delsarte, J. Goethals, J. Seidel (1977)
Spherical codes and designsGeometriae Dedicata, 6
F.R. Gantmakher (1988)
Teoriya matrits
G.A. Kabatianski, V.I. Levenshtein (1978)
Bounds for Packings on a Sphere and in SpaceProbl. Peredachi Inf., 14
A. James (1954)
Normal Multivariate Analysis and the Orthogonal GroupAnnals of Mathematical Statistics, 25
W.H. Foster, I. Krasikov (2000)
Bounds for the Extreme Roots of Orthogonal PolynomialsInt. J. Math. Algorithms, 2
D. Agrawal, T. Richardson, R. Urbanke (2000)
Multiple-antenna signal constellations for fading channels2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
L. Vretare (1984)
Formulas for Elementary Spherical Functions and Generalized Jacobi PolynomialsSiam Journal on Mathematical Analysis, 15
(1978)
Levenshtein, Bounds for packings on the sphere and in the space, Probl. Inf. Transm
J. Conway, R. Hardin, N. Sloane (2002)
Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExp. Math., 5
P. Lancaster, M. Tismenetsky (1969)
The theory of matrices
K. Mukkavilli, A. Sabharwal, E. Erkip, B. Aazhang (2003)
On beamforming with finite rate feedback in multiple-antenna systemsIEEE Trans. Inf. Theory, 49
D. Love, R. Heath (2005)
Limited feedback unitary precoding for spatial multiplexing systemsIEEE Transactions on Information Theory, 51
A. Edelman, T. Arias, S.T. Smith (1998)
The Geometry of Algorithms with Orthogonality ConstraintsSIAM J. Matrix Anal. Appl., 20
(1999)
Introduction to Coding Theory, third ed
G. Szegö (1959)
Orthogonal Polynomials
V. Levenshtein (1995)
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spacesIEEE Trans. Inf. Theory, 41
(1983)
Levenshtein,Granicy upakovok metriqeskih prostranstv i nekotorye ih priloжeni
V.I. Levenshtein (1998)
Handbook of Coding Theory
A. Barg, D. Nogin (2002)
Bounds on packings of spheres in the Grassmann manifoldIEEE Trans. Inf. Theory, 48
P. Shor, Neil Sloane (1998)
A Family of Optimal Packings in Grassmannian ManifoldsJournal of Algebraic Combinatorics, 7
V.I. Levenshtein (1983)
Bounds on Packings of Metric Spaces and Some of Their ApplicationsProbl. Kibern., 40
C. Bachoc (2006)
Linear programming bounds for codes in grassmannian spacesIEEE Transactions on Information Theory, 52
V. Levenshtein (1998)
Universal bounds for codes and designs, in Handbookof Coding Theory
R. McEliece, E. Rodemich, H. Rumsey, L. Welch (1977)
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Trans. Inf. Theory, 23
R. Rankin (1955)
The Closest Packing of Spherical Caps in n DimensionsProceedings of the Glasgow Mathematical Association, 2
(1975)
Orthogonal polynomials, Colloquium Publications
(1983)
Granicy upakovok metriqeskih prostranstv i nekotorye ih priloжeni, Problemy kibernet Bounds on packings of metric spaces and some of their applications
(1977)
and L
M. Ismail, Xin Li (1992)
Bound on the extreme zeros of orthogonal polynomials, 115
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.
Problems of Information Transmission – Springer Journals
Published: Jul 7, 2006
Access the full text.
Sign up today, get DeepDyve free for 14 days.