Sciweavers

MOC
1998
97views more  MOC 1998»
13 years 10 months ago
Euclid's algorithm and the Lanczos method over finite fields
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
Jeremy Teitelbaum
CORR
2004
Springer
138views Education» more  CORR 2004»
13 years 10 months ago
The Accelerated Euclidean Algorithm
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch
Sidi Mohamed Sedjelmaci
ISCAS
2003
IEEE
96views Hardware» more  ISCAS 2003»
14 years 4 months ago
High-speed VLSI architecture for parallel Reed-Solomon decoder
—This paper presents high-speed parallel Reed–Solomon (RS) (255,239) decoder architecture using modified Euclidean algorithm for the high-speed multigigabit-per-second fiber op...
Hanho Lee
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
14 years 4 months ago
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 greatest common di...
Damien Stehlé, Paul Zimmermann