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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
