| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950872 | Information Processing Letters | 2017 | 9 Pages |
Abstract
We suggest a variant of the Berlekamp-Massey algorithm, originally used for recovering a linear shift register from known output bits, for recovering a linear recurrence satisfied by a sequence of natural numbers from known values of the sequence. We present an application of the algorithm to recovering extremely complex recurrences satisfied by the sequences enumerating polyominoes on twisted cylinders.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet, Ronnie Barequet,