Highly Influenced

# Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array

@article{Sakata1988FindingAM, title={Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array}, author={Shojiro Sakata}, journal={J. Symb. Comput.}, year={1988}, volume={5}, pages={321-337} }

- Published 1988 in J. Symb. Comput.
DOI:10.1016/S0747-7171(88)80033-6

We present an algorithm for finding a minimal set of two-dimensional linear recurring relations capable of generating a prescribed finite two-dimensional array. This is a twodimensional extension of the Berlekamp-Massey algorithm for synthesizing a shortest linear feedback shift-register capable of generating a given finite sequence. The complexity of computation for an array of size n is O(n 2) under some reasonable assumptions. Furthermore, we make clear some relationship between ourâ€¦Â CONTINUE READING

Highly Influential

This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Highly Cited

This paper has 76 citations. REVIEW CITATIONS

#### 9 Figures & Tables

#### Topics

#### Statistics

Citations per Year

#### 77 Citations

Semantic Scholar estimates that this publication has

**77**citations based on the available data.See our **FAQ** for additional information.