|
Factorization of polynomials over finite fields
Author:
Robert J. McEliece
Journal:
Math. Comp. 23 (1969), 861-867
MSC:
Primary 12.25; Secondary 94.00
MathSciNet review:
0257039
Full-text PDF Free Access
Abstract |
References |
Similar Articles |
Additional Information
Abstract: If is a polynomial over , we observe (as has Berlekamp) that if , then . The object of this paper is to give an explicit construction of enough such 's so that the repeated application of this result will succeed in separating all irreducible factors of . The 's chosen are loosely defined by . A detailed example over is given, and a table of the factors of the cyclotomic polynomials , is included.
- [1]
R. W. Marsh, Table of Irreducible Polynomials over
through Degree 19, NSA, U.S. Department of Commerce, Office of Tech. Service, Washington, D.C., 1951.
- [2]
E.
R. Berlekamp, Factoring polynomials over finite fields, Bell
System Tech. J. 46 (1967), 1853–1859. MR 0219231
(36 #2314)
- [3]
Serge
Lang, Algebra, Addison-Wesley Publishing Co., Inc., Reading,
Mass., 1965. MR
0197234 (33 #5416)
- [1]
- R. W. Marsh, Table of Irreducible Polynomials over
through Degree 19, NSA, U.S. Department of Commerce, Office of Tech. Service, Washington, D.C., 1951.
- [2]
- E. R. Berlekamp, ``Factoring polynomials over finite fields,'' Bell System Tech. J., v. 46, 1967, pp. 1853-1859. MR 36 #2314. MR 0219231 (36:2314)
- [3]
- S. Lang, Algebra, Addison-Wesley, Reading, Mass., 1965. MR 33 #5416. MR 0197234 (33:5416)
Similar Articles
Retrieve articles in Mathematics of Computation
with MSC:
12.25,
94.00
Retrieve articles in all journals
with MSC:
12.25,
94.00
Additional Information
DOI:
http://dx.doi.org/10.1090/S0025-5718-1969-0257039-X
PII:
S 0025-5718(1969)0257039-X
Article copyright:
© Copyright 1969 American Mathematical Society
|