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
On syndrome decoding of Chinese remainder codes
A unique decoder for the Chinese remainder codes was stated in [1] in 2000. In this paper, we present a decoder which gives the… 
2010
2010
A Security Weakness in Composite-Order Pairing-Based Protocols with Imbedding Degree k>2
In this note we describe a security weakness in pairing- based protocols when the group order is composite and the imbedding… 
2010
2010
A 2n scaling scheme for signed RNS integers and its VLSI implementation
High efficient implementation of scaling in residue number system (RNS) is one of the critical issues for the applications of RNS… 
2006
2006
Hidden constructions in abstract algebra (6) The theorem of Maroscia, Brewer and Costa
We give a constructive deciphering for a generalization of the Quillen-Suslin theorem due to Maroscia and Brewer & Costa stating… 
1999
1999
Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication… 
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… 
Review
1987
Review
1987
Complex digital signal processing over finite rings
Very recently, the quadratic residue number system (QRNS) has been introduced [8], [9]. It is, in fact, a rediscovery of earlier… 
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… 
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)