We use cookies in order to improve the quality and usability of the HSE website. More information about the use of cookies is available here, and the regulations on processing personal data can be found here. By continuing to use the site, you hereby confirm that you have been informed of the use of cookies by the HSE website and agree with our rules for processing personal data. You may disable cookies in your browser settings.
119048Moscow, Usacheva str., 6
phone/fax: +7 (495) 624-26-16
phone: +7 (495) 916-89-05
e-mail: math@hse.ru
Error correcting codes are at the heart of the digital world and therefore play a central role in modern societies. In the late 70's, V.D. Goppa constructed the first error correcting codes from algebraic geometry. The problem of construction of "good" algebraic geometric codes reduces to the question of finding curves of arbitrary large genus defined over finite fields with many rational points.
After recalling basic definitions and properties concerning codes, we will focus on algebraic geometric codes and on their relations to global fields. We will discuss several constructions of asymptotically good families of curves over finite fields that lead to good codes. Namely,
If time permits, we will also cover the constructions of sphere packings (continuous analogues of codes) that use number fields. In the course we will deal with algebraic curves, the Riemann-Roch and Riemann--Hurwitz theorems, the ramification theory, the class field theory, Galois cohomology. All the necessary notions and results will be recalled.
The last lecture will be devoted to the most recent advances concerning invariants of infinite global fields.
Prerequisites. The audience should be familiar with *basic* algebraic geometry and algebraic number theory, although necessary results might be recalled without proofs.