Degrees of irreducible polynomials over binary field
classification
🧮 math.NT
math.CO
keywords
polynomialsbinarycorrespondingdegreesfieldalgorithmassociatedberlekamp
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.