Extended Euclidean algorithm

Known as: Extended Euclid's algorithm, Xgcd, Euclidean 
In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, which computes, besides the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2018
020406019702018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The execution flow of the binary extended Euclidean algorithm (BEEA) is heavily dependent on its inputs. Taking advantage of that… (More)
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2013
2013
In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9… (More)
Is this relevant?
2011
2011
Recently, Naranjo, López-Ramos and Casado have proposed a key refreshment for multicast schemes based on the extended Euclidean… (More)
Is this relevant?
2010
2010
We present an algorithm for decoding Reed-Solomon codes beyond half the minimum distance by using reliability information which… (More)
  • figure 1
  • figure 2
Is this relevant?
2010
2010
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows… (More)
  • figure 1
Is this relevant?
2008
2008
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A new growing method for simplex-based endmember extraction algorithms (EEAs), called simplex growing algorithm (SGA), is… (More)
  • figure 2
  • table I
  • figure 3
  • figure 4
  • table II
Is this relevant?
Review
2003
Review
2003
Euclid’s algorithm for computing the greatest common divisor of 2 numbers is considered to be the oldest proper algorithm known… (More)
Is this relevant?
2002
2002
We accelerate the extended Euclidean algorithm for integers, the rational number reconstruction, and consequently, the stage of… (More)
Is this relevant?
2001
2001
A new parallelization of Euclid’s greatest common divisor algorithm is proposed. It matches the best existing integer GCD… (More)
Is this relevant?