Excellent codes from modular curves

DOI10.1145/380752.380802zbMath1323.94171arXivmath/0104115OpenAlexW1997893638MaRDI QIDQ5175969

Noam D. Elkies

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Approximation algorithms (68W25) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (5)

Further improvements on asymptotic bounds for codes using distinguished divisors ⋮ Upper bounds for some Brill–Noether loci over a finite field ⋮ Nonlinear codes from points of bounded height ⋮ Nonuniform Fuchsian codes for noisy channels ⋮ Construction of global function fields from linear codes and vice versa

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Excellent codes from modular curves