Abstract
The most important development in the theory of error-correcting codes in recent years is the introduction of methods from algebraic geometry to construct good codes. The ideas are based on generalizations of so-called Goppa codes. The (by now) “classical” Goppa codes (1970, cf.[6]) were already a great improvement on codes known at that time. The algebraic geometric codes were also inspired by ideas of Goppa but the most sensational development was a paper by Tsfasman, Vlădut and Zink (1982,cf.[15]). In this paper the idea of codes from algebraic curves was combined with certain recent deep results from algebraic geometry to produce a sequence of error-correcting codes that led to a new lower bound on the information rate of good codes that is better than the Gilbert-Varshamov bound. The novice reader should realize that the G-V-bound (1952) was never improved (until 1982) and believed by many to be best possible. Actually, the improvement is only achieved for alphabets of size at least 49 and several binary coding experts still have hope that no improvement of the G-V-bound for F2 will be possible; (this author is not one of them).
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.
References
A.M.Barg, S.L.Katsman and M.A.Tsfasman, Algebraic Geometric Codes from Curves of Small Genus, Probl.of Information Transmission, 23 (1987), pp. 34–38.
T.Beth, Some aspects of coding theory between probability, algebra, combinatorics and complexity theory, in Combinatorial Theory, Lecture Notes in Mathematics 969, Springer Verlag, New York.
Y.Driencourt and J.F.Michon, Rapport sur les Codes Géométriques, Univ.Aix-Marseille II et Université Paris 7.
W.Fulton, Algebraic Curves, Benjamin Cummings, Reading, 1969.
G. van der Geer and J.H. van Lint, Introduction to Coding Theory and Algebraic Geometry, DMV Lecture Notes (to appear).
V.D.Goppa, A new class of linear error-correcting codes, Probl.of Information Transmission, 6 (1970), pp. 207–212.
J.Justesen, K.J.Larsen, H. Elbrønd Jensen, A.Havemose and T.Høholdt, Construction and decoding of a class of algebraic geometry codes, MAT.Rep.No.1988-10, Danmarks Tekniske Højskole.
G.Lachaud, Les codes géométriques de Goppa, Séminaire Bourbaki, no.641.
J.H. van Lint, Introduction to Coding Theory, Springer Verlag, New York, 1982.
J.H. van Lint and T.A.Springer, Generalized Reed-Solomon Codes from Algebraic Geometry, IEEE Trans.on Information Theory, IT-33 (1987), pp. 305–309.
F.J.Mac Williams and N.J.A.Sloane, The Theory of Error-Correcting Codes, North Holland, Amsterdam, 1977.
J.-P. Serre, Sur le nombre des points rationnels d’une courbe algébrique sur un corps fìni, C.R. Acad. Sc. Paris, 296 (1983), pp. 397–402.
A.N.Skorobogatov and S.G.Vlädut, On the Decoding of Algebraic-Geometric Codes, preprint.
M.A.Tsfasman, Goppa codes that are better than the Varshamov-Gilbert bound, Probl.of Information Transmission, 18 (1982), pp. 163–165.
M.A.Tsfasman, S.G.Vlädut and T.Zink, Modular curves, Shimura curves and Goppa codes better than the Varshamov- Gilbert bound, Math.Nachr., 109 (1982), pp. 21–28.
M.Wirtz, Verallgemeinerte Goppa-Codes, Diplomarbeit University of Munster (W.Germany).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Van Lint, J.H. (1990). Algebraic Geometric Codes. In: Coding Theory and Design Theory. The IMA Volumes in Mathematics and Its Applications, vol 20. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8994-1_12
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8994-1_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8996-5
Online ISBN: 978-1-4613-8994-1
eBook Packages: Springer Book Archive