000			03232nam a22002657a 4500
003			OSt
005			20250617132138.0
008			250617b |||||||| |||| 00| 0 hin d
020			_a9789349750296
040			_aNISER LIBRARY _cNISER LIBRARY _beng
082	0	0	_a519.711 _bWAL-C
100	1		_aWalker, Judy L.
245	1	0	_aCodes and curves
260			_aIndia : _bUniversities Press, _c2025.
300			_ax, 68 p. : _bill. ; _c22 cm.
490			_aStudent mathematical library, _x1520-9121 ; _vv. 7. _aIAS/Park City mathematical subseries
504			_aIncludes bibliographical references (p. 65-66).
520			_aWhen information is transmitted, errors are likely to occur. This problem has become increasingly important as tremendous amounts of information are transferred electronically every day. Coding theory examines efficient ways of packaging data so that these errors can be detected, or even corrected. The traditional tools of coding theory have come from combinatorics and group theory. Since the work of Goppa in the late 1970s, however, coding theorists have added techniques from algebraic geometry to their toolboxes. In particular, by re-interpreting the Reed-Solomon codes as coming from evaluating functions associated to divisors on the projective line, one can see how to define new codes based on other divisors or on other algebraic curves. For instance, using modular curves over finite fields, Tsfasman, Vladut, and Zink showed that one can define a sequence of codes with asymptotically better parameters than any previously known codes. This book is based on a series of lectures the author gave as part of the IAS/Park City Mathematics Institute (Utah) program on arithmetic algebraic geometry. Here, the reader is introduced to the exciting field of algebraic geometric coding theory. Presenting the material in the same conversational tone of the lectures, the author covers linear codes, including cyclic codes, and both bounds and asymptotic bounds on the parameters of codes. Algebraic geometry is introduced, with particular attention given to projective curves, rational functions and divisors. The construction of algebraic geometric codes is given, and the Tsfasman-Vladut-Zink result mentioned above is discussed. No previous experience in coding theory or algebraic geometry is required. Some familiarity with abstract algebra, in particular finite fields, is assumed. However, this material is reviewed in two appendices. There is also an appendix containing projects that explore other codes not covered in the main text. This book is published in cooperation with IAS/Park City Mathematics Institute.
521			_aReadership: Undergraduates in mathematics; mathematicians interested in coding theory or algebraic geometry and the connections between the two subjects.
650		0	_aCoding theory.
650		0	_aCurves, Algebraic.
856			_3Table of Contents _uhttps://www.ams.org/bookstore/pspdf/stml-7-prev.pdf?_gl=1*tsw5gh*_ga*NzkyMDE0ODczLjE3NTAwNDYzMjU.*_ga_26G4XFTR63*czE3NTAxMzI2MzckbzIkZzEkdDE3NTAxNDU4OTgkajUzJGwwJGgw
856			_3Reviews _uhttps://www.goodreads.com/book/show/6091359-codes-and-curves?ref=nav_sb_ss_2_16#CommunityReviews
942			_2udc _cN
999			_c36066 _d36066