Loading...
Please wait, while we are loading the content...
Similar Documents
On Polynomial Factorization Over Finite Fields
| Content Provider | Scilit |
|---|---|
| Author | Gunji, Hiroshi Arnon, Dennis |
| Copyright Year | 1981 |
| Description | Let be a polynomial over a finite field F. An algorithm for determining the degrees of the factors of is presented. As in the Berlekamp algorithm (1968) for determining the factors of , the Frobenius endomorphism on plays a central role. Little-known theorems of Schwarz (1956) and Cesàro (1888) provide the basis for the algorithm we present. New and stream-lined proofs of both theorems are provided. |
| Related Links | https://www.ams.org/mcom/1981-36-153/S0025-5718-1981-0595063-3/S0025-5718-1981-0595063-3.pdf |
| Ending Page | 287 |
| Page Count | 7 |
| Starting Page | 281 |
| ISSN | 00255718 |
| e-ISSN | 10886842 |
| DOI | 10.2307/2007747 |
| Journal | Mathematics of Computation |
| Issue Number | 153 |
| Volume Number | 36 |
| Language | English |
| Publisher | Duke University Press |
| Publisher Date | 1981-01-01 |
| Access Restriction | Open |
| Subject Keyword | Logic Finite Fields Frobenius Cesàro Stream Endomorphism Berlekamp Schwarz Polynomial Factorization |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Algebra and Number Theory Computational Mathematics |