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)

Related topics

Related topics

7 relations
Bruun's FFT algorithmFactor theoremHorner's methodPolynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Linear complexity of quaternary sequences of length pq with low autocorrelation
2012
2012
Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks
Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to “rendezvous” before… 
2010
2010
A Reverse Converter for the Enhanced Moduli Set {2n-1, 2n+1, 22n, 22n+1-1} Using CRT and MRC
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
Threshold Secret Image Sharing by Chinese Remainder Theorem
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
New Chinese remainder theorems
  • Yuke Wang
  • Conference Record of Thirty-Second Asilomar…
  • 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
Highly parallel, fast scaling of numbers in nonredundant residue arithmetic
A new approach to scaling in the nonredundant residue number system (RNS) with the use of the Chinese remainder theorem (CRT) is… 
1997
1997
Scaled and unscaled residue number system to binary conversion techniques using the core function
  • N. Burgess
  • Proceedings 13th IEEE Sympsoium on Computer…
  • 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
A fast algorithm to retrieve symbolic pictures
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
Techniques for residue-to-analog conversion for residue-encoded digital filters
Recent papers have reported that the use of residue number coding in digital filters can result in better speed/cost ratios when… 
1975
1975
On the derivation of Goppa codes (Corresp.)
It is shown that Goppa codes can be derived by means of the Chinese remainder theorem from codes previously constructed. 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)