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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.