Codes and modular curves

Codes et courbes modulaires

Alain Couvreur (1)

1 GRACE - Geometry, arithmetic, algorithms, codes and encryption

These lecture notes have been written for a course at the Algebraic Coding Theory (ACT) summer school 2022 that took place in the university of Zurich. The objective of the course propose an in-depth presentation of the proof of one of the most striking results of coding theory: Tsfasman Vl\u{a}du\c{t} Zink Theorem, which asserts that for some prime power $q$, there exist sequences of codes over $\mathbb{F}_q$ whose asymptotic parameters beat random codes.

Domaines: Mathématiques [math]; Informatique [cs]

Alain Couvreur. Codes and modular curves. Doctoral. Codes and Modular curves, Zurich, Switzerland. 2022, pp.33. ⟨hal-03932020⟩