Year: 2017
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Chang, Yaotsu, Lee, Chong-Dao, Liu, Chia-an
Institution: I-Shou University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2605577533