Codes and modular curves
From MaRDI portal
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 Vlu{a}duc{t} Zink Theorem, which asserts that for some prime power , there exist sequences of codes over whose asymptotic parameters beat random codes.
This page was built for publication: Codes and modular curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6422963)
