Codes and modular curves
January 09, 2023 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Alain Couvreur
arXiv ID
2301.03569
Category
math.NT
Cross-listed
cs.IT,
math.AG
Citations
0
Venue
arXiv.org
Last Checked
1 month ago
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ΔduΕ£ 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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.NT
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
An analogue of Vosper's Theorem for Extension Fields
R.I.P.
π»
Ghosted
Improved torsion point attacks on SIDH variants
R.I.P.
π»
Ghosted
Ramanujan graphs in cryptography
R.I.P.
π»
Ghosted
Locally Recoverable Codes with Availability $t\geq 2$ from Fiber Products of Curves
R.I.P.
π»
Ghosted
Failing to hash into supersingular isogeny graphs
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted