Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter Original Research Article

An algorithm is presented yielding substitutions (finite automata) for linear shift register sequences over finite fields. Some computational applications of these substitutions are discussed, and connections to both Berlekampʹs and Niederreiterʹs factorization algorithms polynomials over finite fields are established.