Loading...
Please wait, while we are loading the content...
Similar Documents
On polynomial factorization over finite fields
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gunji, Hiroshi Arnon, Dennis S. |
| Copyright Year | 1981 |
| Abstract | Let f(x) be a polynomial over a finite field F. An algorithm for determining the degrees of the factors of f(x) is presented. As in the Berlekamp algorithm (1968) for determining the factors of f(x), the Frobenius endomorphism on F[x]/(f(x)) plays a central role. Little-known theorems of Schwarz (1956) and Cesaro (1888) provide the basis for the algorithm we present. New and stream-lined proofs of both theorems are provided. |
| Starting Page | 281 |
| Ending Page | 287 |
| Page Count | 7 |
| File Format | PDF HTM / HTML |
| DOI | 10.1090/S0025-5718-1981-0595063-3 |
| Alternate Webpage(s) | http://www.ams.org/journals/mcom/1981-36-153/S0025-5718-1981-0595063-3/S0025-5718-1981-0595063-3.pdf |
| Alternate Webpage(s) | https://doi.org/10.1090/S0025-5718-1981-0595063-3 |
| Volume Number | 36 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |