Spectral approach to linear programming bounds on codes

Authors:
A. M. Barg;D. Yu. Nogin
Affiliations:
Institute for Information Transmission Problems, RAS, Moscow University of Maryland, College Park, USA 20742;Institute for Information Transmission Problems, RAS, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2006

Citing 0
Cited 2

One family of algebraic codes for network coding

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Algebraic codes for network coding

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

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.