A functional view of upper bounds on codes

Details A functional view of upper bounds on codes A functional view of upper bounds on codes

2008-08-30

arxiv.org/abs/0809.0091v1

" Coding and Cryptography," Proceedings of the First International Workshop, Wuyi Mountain, Fujian, China, 11 - 15 June 2007,

Computer Science

Information Theory

10 pages

Scientific paper

Functional and linear-algebraic approaches to the Delsarte problem of upper bounds on codes are discussed. We show that Christoffel-Darboux kernels and Levenshtein polynomials related to them arise as stationary points of the moment functionals of some distributions. We also show that they can be derived as eigenfunctions of the Jacobi operator. This motivates the choice of polynomials used to derive linear programming upper bounds on codes in homogeneous spaces.

Affiliated with

Also associated with

No associations

Rating

A functional view of upper 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 A functional view of upper bounds on codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A functional view of upper bounds on codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578205