Bounds for Codes and Sphere Packings
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.
KeywordsPacking Problem Jacobi Polynomial Association Scheme Sphere Packing Dual Code
Unable to display preview. Download preview PDF.