Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0104115

Excellent nonlinear codes from modular curves

Noam D. Elkies
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g -> infty over a field of size q0^2 yield nonlinear codes more efficient than the linear Goppa codes obtained from the same curves. These new codes now have the highest asymptotic transmission rates known for certain ranges of alphabet size and error rate. Both the theory and possible practical use of these new record codes require the development of new tools. On the theoretical side, establishing the transmission rate depends on an error estimate for a theorem of Schanuel applied to the function field of an asymptotically optimal curve. On the computational side, actual use of the codes will hinge on the solution of new problems in the computational algebraic geometry of curves.

Explore related subjects

math.NTcs.ITmath.AGmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Noam D. Elkies. 2001-04-10. Excellent nonlinear codes from modular curves. https://arxiv.org/abs/math/0104115

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the Pair Correlation of Zeros of $L$-Functions for Non-CM Newforms in Shifted Ranges

We study the pair correlation between zeros of a shifted auxiliary $ L $-function attached to a non-CM newform, the scale of which is a fixed constant. We prove an unconditional asymptotic result for the pair correlation and introduce a simplicity hypothesis for the zeros of this function, which if true means that multiple zeros of the original $ L $-function cannot be separated by the same fixed distance. Our results provide macroscopic information in contrast to the pair correlation of the original $ L $-function which is of microscopic nature.

math.NT↗
arXiv2026

Prime Solutions to a Binary Additive Equation and Mixed Moments of Character Sums

We obtain an asymptotic formula with a power-saving error term for counting the integer points $(a,b,c,d)$ in an expanding box that satisfy the determinant equation $x_1x_2-x_3x_4 =r$ for $r \neq 0 $ with two of entries to be prime. Finally, these estimates are applied to evaluate mixed fourth moments of Dirichlet character sums over integers and primes, yielding non-trivial bounds. The method involves the Poisson summation formula and the estimation for the average of the sums of the Kloosterman fractions over primes.

math.NT↗
arXiv2026

On properness of moduli stacks of $D^{\times}$-shtukas over ramified legs

Given a maximal order $\mathcal{D}$ of a central division algebra $D$ over a global function field $F$, we prove an explicit sufficient condition for moduli stacks of $\mathcal{D}^\times$-shtukas to be proper over a finite field (modulo a suitable central action) in terms of the \emph{local invariants} of $D$ and \emph{bounds}. Our proof is a refinement of E.~Lau's result (Duke Math. J. \textbf{140} (2007)), which showed the properness of the \emph{leg morphism} (or \emph{characteristic morphism}) away from the ramification locus of $D$. %, by carefully measuring the contribution of ``ramified legs''. We also establish non-emptiness of Newton and Kottwitz--Rapoport strata for moduli stacks of $\mathcal{B}^\times$-shtukas, where $\mathcal{B}$ is a maximal order of a central simple algebra over $F$.

math.NT↗