Abstract
The parameters of codes of large length n are of particular interest. As it happens quite often, if a problem has no easy answer for each particular n - just as our problem of finding out the best possible parameters of a code - passing to the limit for n → ∞ helps us to avoid “deviations” and to understand the behaviour of parameters better. In this chapter we state the problems rigorously and discuss those results that do not use algebraic-geometric codes. We shall return to asymptotic problems in Chapter 3.4, since asymptotic results are the best to demonstrate the power of algebraic-geometric methods.
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.
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). Asymptotic Problems. In: Algebraic-Geometric Codes. Mathematics and Its Applications (Soviet Series), vol 58. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3810-9_3
Download citation
DOI: https://doi.org/10.1007/978-94-011-3810-9_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-0335-6
Online ISBN: 978-94-011-3810-9
eBook Packages: Springer Book Archive