arXiv · 1704.03637
Degrees of irreducible polynomials over binary field
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.
Explore related subjects
Keep this discovery
Yaotsu Chang, Chong-Dao Lee, Chia-an Liu. 2017-04-12. Degrees of irreducible polynomials over binary field. https://arxiv.org/abs/1704.03637
Cite the original work for its findings. Save a collection to share your selection of sources.