Recovering highly-complex linear recurrences of integer sequences

DOI10.1016/J.IPL.2017.07.006MaRDI QIDQ2398508zbMATH OpenOpenAlexFDO

Authors Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet, Ronnie Barequet

Publication date 16 August 2017

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2017.07.006

zbMATH Keywords

algorithmspolyominoesChinese remainder theoremrecurrence formula

Mathematics Subject Classification ID

Recurrences (11B37)

Recommendations

• The Berlekamp-Massey algorithm revisited
• Extension of the Berlekamp-Massey algorithm to N dimensions
• Formulae for polyominoes on twisted cylinders
• An Efficient Formula for Linear Recurrences
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array

Cites work

• scientific article; zbMATH DE number 3910296 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• A pattern theorem for lattice clusters
• Algebraic coding theory
• Cell Growth Problems
• Counting polyominoes on twisted cylinders
• Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
• Formulae for polyominoes on twisted cylinders
• Shift Register Synthesis (Modulo m)
• Shift-register synthesis and BCH decoding

Cited in

(1)

• Formulae for polyominoes on twisted cylinders

This page was built for publication: Recovering highly-complex linear recurrences of integer sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398508)