Minimal Polynomial Algorithms for Finite Sequences

Abstract

We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.

Section 2 added, remarks and references expanded. To appear in IEEE Transactions on Information Theory.

Cited by in corpus (1)

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