An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings

The construction of shortest feedback shift registers for a finite sequence S 1 , … , S N is considered over finite chain rings, such as Z p r . A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for the sequence of numbers S 1 , … , S N , thus solv...

Ausführliche Beschreibung