Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sloane, N.J.A. (1999). Bounds for Codes and Sphere Packings. In: Sphere Packings, Lattices and Groups. Grundlehren der mathematischen Wissenschaften, vol 290. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-6568-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6568-7_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3134-4
Online ISBN: 978-1-4757-6568-7
eBook Packages: Springer Book Archive