Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
DOI10.1016/S0747-7171(88)80033-6zbMATH Open0647.68044MaRDI QIDQ1104749FDOQ1104749
Authors: Shojiro Sakata 
Publication date: 1988
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Recommendations
complexity of computationpolynomial idealslinear recurring relationsBerlekamp- Massey algorithmfinite two-dimensional arraylinear feedback shift-registerGröbner bases
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Finite fields and commutative rings (number-theoretic aspects) (11T99) Arithmetic codes (94B40)
Cites Work
- Shift-register synthesis and BCH decoding
- Title not available (Why is that?)
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- A theory of two-dimensional cyclic codes
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
- General theory of doubly periodic arrays over an arbitrary finite field and its applications
- Impulse response arrays of discrete-space systems over a finite field
Cited In (31)
- The degeneracy problem of two-dimensional linear recurring arrays
- Polynomial-division-based algorithms for computing linear recurrence relations
- Finding recursions for multidimensional arrays
- Gröbner basis approach to list decoding of algebraic geometry codes
- Sparse FGLM algorithms
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Theory behind quantum error correcting codes: an overview
- Polynomial-exponential decomposition from moments
- On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
- Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm
- Title not available (Why is that?)
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Linear recurring sequences over modules
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear feedback shift registers and the minimal realization problem
- On evaluating multivariate polynomials over finite fields
- Linear recurring sequences over rings and modules
- Multidimensional linear complexity analysis of periodic arrays
- Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
- Guessing Gröbner bases of structured ideals of relations of sequences
- Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring
- Algorithms for linearly recurrent sequences of truncated polynomials
- Solving a congruence on a graded algebra by a subresultant sequence and its application
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
- Recursive partial realization for 2-D data arrays
- A behavioral approach to identifiability of 2D scalar systems
This page was built for publication: Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104749)
