Excellent codes from modular curves
From MaRDI portal
Publication:5175969
DOI10.1145/380752.380802zbMath1323.94171arXivmath/0104115MaRDI QIDQ5175969
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0104115
68Q25: Analysis of algorithms and problem complexity
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
68W25: Approximation algorithms
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Upper bounds for some Brill–Noether loci over a finite field, Nonlinear codes from points of bounded height, Nonuniform Fuchsian codes for noisy channels, Further improvements on asymptotic bounds for codes using distinguished divisors, Construction of global function fields from linear codes and vice versa
Cites Work