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.
Full Text
Published Version
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 call