| Article ID: | iaor19921462 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 1/3 |
| Start Page Number: | 241 |
| End Page Number: | 256 |
| Publication Date: | Nov 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Tsfaman Michael A. |
This is an attempt to analyze the present state of affairs concerning asymptotic bounds in coding theory. The advantages of algebraic-geometric approach to codes are most illustrious when asymptotic problems are considered. The paper tries to show how to put different asymptotic problems, what is known about their solutions, and how algebraic-geometric codes influence the situation.