Degrees of irreducible polynomials over binary field

2017/04/12 by Chang, Yaotsu, Lee, Chong-Dao, Liu, Chia-an
#11T06 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1704.03637

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.

Related

• An algorithm for determining the irreducible polynomials over finite fields
• Irreducible Compositions of Polynomials over Finite Fields
• Number of irreducible polynomials in several variables over finite fields
• Prime numbers and factorization of polynomials
• Factorization of composed polynomials and applications