Key points are not available for this paper at this time.
We present here an algorithm for factoring a given polynomial over GF(q) into powers of irreducible polynomials. The method reduces the factorization of a polynomial of degree m over GF(q) to the solution of about m(q − 1)/q linear equations in as many unknowns over GF(q).
Elwyn R. Berlekamp (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: