Spectral approach to linear programming bounds on codes

Details Spectral approach to linear programming bounds on codes Spectral approach to linear programming bounds on codes

2005-12-06

arxiv.org/abs/cs/0512025v2

Computer Science

Information Theory

11 pages, submitted

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Spectral approach to linear programming bounds on codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spectral approach to linear programming bounds on codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral approach to linear programming bounds on codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-697610