A note on Gröbner bases and Berlekamp’s algorithm
作者：
Highlights：
•
摘要
It will be shown that it is possible to factorize square-free polynomials over finite fields using Gröbner bases and a MAPLE implementation of this method will be described.
论文关键词：Gröbner bases,Finite fields,Factorization of polynomials,Berlekamp’s algorithm,Maple
论文评审过程：Available online 26 May 2007.
论文官网地址：https://doi.org/10.1016/j.amc.2007.05.038
