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
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud