Band 254
Algebraic Function Fields and Codes
Aus der Reihe
Graduate Texts in Mathematics
-
- Hardcover
- Taschenbuch ausgewählt
-
Sprache:Englisch
Fr. 93.90
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
18.11.2010
Abbildungen
XIV, 360 p.
Verlag
Springer BerlinSeitenzahl
360
Maße (L/B/H)
23.5/15.5/2.1 cm
Gewicht
569 g
Auflage
Softcover reprint of hardcover 2nd ed. 2008
Sprache
Englisch
ISBN
978-3-642-09556-6
15 years after the ?rst printing of Algebraic Function Fields and Codes,the mathematics editors of Springer Verlag encouraged me to revise and extend the book. Besides numerous minor corrections and amendments, the second edition di?ers from the ?rst one in two respects. Firstly I have included a series of exercises at the end of each chapter. Some of these exercises are fairly easy and should help the reader to understand the basic concepts, others are more advanced and cover additional material. Secondly a new chapter titled “Asymptotic Bounds for the Number of Rational Places” has been added. This chapter contains a detailed presentation of the asymptotic theory of function ?elds over ?nite ?elds, including the explicit construction of some asymptotically good and optimal towers. Based on these towers, a complete and self-contained proof of the Tsfasman-Vladut-Zink Theorem is given. This theorem is perhaps the most beautiful application of function ?elds to coding theory. The codes which are constructed from algebraic function ?elds were ?rst introduced by V. D. Goppa. Accordingly I referred to them in the ?rst edition as geometric Goppa codes. Since this terminology has not generally been - cepted in the literature, I now use the more common term algebraic geometry codes or AG codes. I would like to thank Alp Bassa, Arnaldo Garcia, Cem Guneri, ¨ Sevan Harput and Alev Topuzo? glu for their help in preparing the second edition.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.