arXiv · 2301.03569
Codes and modular curves
Abstract
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.
Explore related subjects
Keep this discovery
Alain Couvreur. 2023-01-09. Codes and modular curves. https://arxiv.org/abs/2301.03569
Cite the original work for its findings. Save a collection to share your selection of sources.