In algebra, the polynomial remainder theorem or little Bézout's theorem is an application of Euclidean division of polynomials. It states that the… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Li Xiao, Xiang-Gen Xia
- IEEE Transactions on Communications
- 2015

This paper investigates polynomial remainder codes with non-pairwise coprime moduli. We first consider a robust reconstruction… (More)

Is this relevant?

2012

2012

- Maximilian Jaroschek
- J. Symb. Comput.
- 2012

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative… (More)

Is this relevant?

2011

2011

- Jiun-Hung Yu, Hans-Andrea Loeliger
- 2011 IEEE International Symposium on Information…
- 2011

A general class of polynomial remainder codes is considered. These codes are very flexible in rate and length and include Reed… (More)

Is this relevant?

2008

2008

- Akira Terui
- ArXiv
- 2008

We introduce concepts of “recursive polynomial remainder sequence (PRS)” and “recursive subresultant,” along with investigation… (More)

Is this relevant?

2005

2005

- Akira Terui
- CASC
- 2005

Abstract. We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive… (More)

Is this relevant?

2003

2003

- Akira Terui
- ArXiv
- 2003

We introduce concepts of “recursive polynomial remainder sequence (PRS)” and “recursive subresultant,” and investigate their… (More)

Is this relevant?

1997

1997

- Tateaki Sasaki, Mutsuko K. Sasaki
- ACM SIGSAM Bulletin
- 1997

Let <i>P</i><inf>1</inf> and <i>P</i><inf>2</inf> be polynomials, univariate or multivariate, and let (<i>P</i><inf>1</inf>, <i>P… (More)

Is this relevant?

1995

1995

- Michael Kalkbrener
- Applicable Algebra in Engineering, Communication…
- 1995

Primitive polynomial remainder sequences (pprs) are more than a tool for computing gcd's; the content computations in the course… (More)

Is this relevant?

1995

1995

- Alkiviadis G. Akritas, Evgenia K. Akritas, Gennadi I. Malaschonok
- Reliable Computing
- 1995

We present an impr{wed variant of the matrix-triangularization subresultant prs method [1] fi~r the computation of a greatest… (More)

Is this relevant?

Highly Cited

1967

Highly Cited

1967

- George E. Collins
- J. ACM
- 1967

Let @@@@ be an integral domain, P(@@@@) the integral domain of polynomials over @@@@. Let <italic>P</italic>, <italic>Q</italic… (More)

Is this relevant?