An algorithm for computing minimal bidirectional linear recurrence relations

We consider the problem of computing a linear recurrence relation (or equivalently a linear feedback shift register) of minimum order for a finite sequence over a field, with the additional requirement that not only the highest but also the lowest coefficient of the recurrence is nonzero. Such a rec...

Full description

Saved in:
Bibliographic Details
Main Author: Ana Salagean
Format: Default Article
Published: 2009
Subjects:
Artificial intelligence not elsewhere classified
Other information and computing sciences not elsewhere classified
Berlekamp-Massey algorithm
Linear recurrence relation
Minimal characteristic polynomial
Artificial Intelligence and Image Processing
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/14698
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/14698

Similar Items