Polynomials Over Finite Fields

Maurice Mignotte
Additional contact information
Maurice Mignotte: Université Louis Pasteur, Départment de Mathématique

Chapter Chapter 6 in Mathematics for Computer Algebra, 1992, pp 229-288 from Springer

Abstract: Abstract The first step of modern algorithms of factorization of polynomials with integer coefficients consists in factorizing their image modulo some prime number. This is the reason why, in this chapter, we study the factorization of polynomials over finite fields. Most of the results of this theory were developed by E.R. Berlekamp.

Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9171-5_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461391715

DOI: 10.1007/978-1-4613-9171-5_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().