Computer Science – Information Theory
Scientific paper
2009-11-02
Computer Science
Information Theory
Section 2 added, remarks and references expanded. To appear in IEEE Transactions on Information Theory.
Scientific paper
We show that a straightforward rewrite of a known minimal polynomial
algorithm yields a simpler version of a recent algorithm of A. Salagean.
No associations
LandOfFree
Minimal Polynomial Algorithms for Finite Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Minimal Polynomial Algorithms for Finite Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal Polynomial Algorithms for Finite Sequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-28891