Degrees of irreducible polynomials over binary field
From MaRDI portal
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.
This page was built for publication: Degrees of irreducible polynomials over binary field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6285426)
