Bounds for Codes and Sphere Packings

  • N. J. A. Sloane
Part of the Grundlehren der mathematischen Wissenschaften book series (GL, volume 290)


This chapter surveys recent work on finding bounds for error-correcting codes, constant weight codes, spherical codes, sphere packings, and other packing problems in 2-point-homogeneous spaces. A simplified account is given of the general machinery developed by Kabatiansky and Levenshtein for setting up such problems as linear programs. Many other recent bounds are also described.


Packing Problem Jacobi Polynomial Association Scheme Sphere Packing Dual Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • N. J. A. Sloane

There are no affiliations available

Personalised recommendations