Minimal Polynomial Algorithms for Finite Sequences
Information Theory
2016-11-17 v3 Discrete Mathematics
Symbolic Computation
math.IT
Abstract
We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.
Cite
@article{arxiv.0911.0130,
title = {Minimal Polynomial Algorithms for Finite Sequences},
author = {Graham H. Norton},
journal= {arXiv preprint arXiv:0911.0130},
year = {2016}
}
Comments
Section 2 added, remarks and references expanded. To appear in IEEE Transactions on Information Theory.