Factorization of polynomials over finite fields 论文
1962Pacific Journal of Mathematics引用 255
Coding theory and cryptographygraph theory and CDMA systemsCellular Automata and Applications
摘要
has given an interesting necessary condition for a polynomial over a finite field of odd characteristic to be irreducible. In Theorem 1 below, I will give a generalization of this result which can also be applied to fields of characteristic 2. It also applies to reducible polynomials and gives the number of irreducible factors mod 2.