Skip to search formSkip to main contentSkip to account menu

Polynomial remainder theorem

Known as: Bezout's little theorem, Remainder theorem, Little Bezout Theorem (Factor Theorem) 
In algebra, the polynomial remainder theorem or little Bézout's theorem is an application of Euclidean division of polynomials. It states that the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to “rendezvous” before… 
2010
2010
The moduli set {2n–1, 2n, 2n+1, 22n+1–1} has been newly introduced for residue number system (RNS) as an arithmetic-friendly… 
Highly Cited
2008
Highly Cited
2008
We extend the sharing scheme proposed by Mignotte in 1983 based upon Chinese remainder theorem (CRT) to devise a threshold secret… 
Highly Cited
1998
Highly Cited
1998
  • Yuke Wang
  • 1998
  • Corpus ID: 42787548
The residue-to-binary conversion is the crucial step for residue arithmetic. The traditional methods are the Chinese remainder… 
1998
1998
A new approach to scaling in the nonredundant residue number system (RNS) with the use of the Chinese remainder theorem (CRT) is… 
1997
1997
  • N. Burgess
  • 1997
  • Corpus ID: 27235784
The paper presents related techniques for converting a residue number system (RNS) number to binary, with and without scaling… 
1992
1992
We propose a scheme for determining whether or not a pattern of icons is contained in a subject image. For two icons, their… 
Highly Cited
1978
Highly Cited
1978
Recent papers have reported that the use of residue number coding in digital filters can result in better speed/cost ratios when… 
1975
1975
It is shown that Goppa codes can be derived by means of the Chinese remainder theorem from codes previously constructed.