Degrees of irreducible polynomials over binary field
Number Theory
2017-04-13 v1 Combinatorics
Abstract
An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with their corresponding matrices Q and irreducibility.
Cite
@article{arxiv.1704.03637,
title = {Degrees of irreducible polynomials over binary field},
author = {Yaotsu Chang and Chong-Dao Lee and Chia-an Liu},
journal= {arXiv preprint arXiv:1704.03637},
year = {2017}
}