The Berlekamp-Massey Algorithm via Minimal Polynomials

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Major revision of earlier versions: Introduction expanded, main theorem is now a recursive construction using a recursively de

Scientific paper

We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive 'index function' and simple mathematical induction. Taking reciprocals gives a 'Berlekamp-Massey theorem' i.e. a recursive construction of the polynomials arising in the Berlekamp-Massey algorithm, relative to any element of $D$. The recursive theorem readily yields the iterative minimal polynomial algorithm due to the author and a transparent derivation of the iterative Berlekamp-Massey algorithm. We give an upper bound for the sum of the linear complexities of $s$ which is tight if $s$ has a perfect linear complexity profile. This implies that over a field, both iterative algorithms require at most $2\lfloor \frac{n^2}{4}\rfloor$ multiplications.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Berlekamp-Massey Algorithm via Minimal Polynomials 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 The Berlekamp-Massey Algorithm via Minimal Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Berlekamp-Massey Algorithm via Minimal Polynomials will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-718967

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.