Abstract
In the previous chapter we have seen that there are numerous analogies between linear codes and lattices; we have also constructed the Leech lattice using the Golay code. Here we continue to use codes to obtain packings. In Section 5.2.1 we describe some beautiful constructions which give various dense packings using various code families. Section 5.2.2 is devoted to asymptotically good packings obtained by this construction.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Tsfasman, M.A., Vlăduţ, S.G. (1991). Asymptotically Dense Packings. In: Algebraic-Geometric Codes. Mathematics and Its Applications (Soviet Series), vol 58. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3810-9_18
Download citation
DOI: https://doi.org/10.1007/978-94-011-3810-9_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-0335-6
Online ISBN: 978-94-011-3810-9
eBook Packages: Springer Book Archive