A note on Gröbner bases and Berlekamp’s algorithm

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.