-
Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm
International audience -
Modular Arithmetics before C.F. Gauss.
International audience -
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the... -
On the number of numerical semigroups of prime power genus
Given $g\ge 1$, the number $n(g)$ of numerical semigroups $S \subset \N$ of genus $|\N \setminus S|$ equal to $g$ is the subject of challenging conjectures of... -
New modular multiplication and division algorithms based on continued fractio...
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute...
