Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
From MaRDI portal
Publication:1104749
Recommendations
- Extension of the Berlekamp-Massey algorithm to N dimensions
- scientific article; zbMATH DE number 177894
- scientific article; zbMATH DE number 4105101
- scientific article; zbMATH DE number 4104858
- Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring
Cites work
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- A theory of two-dimensional cyclic codes
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- 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
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
- Shift-register synthesis and BCH decoding
Cited in
(33)- Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm
- Theory behind quantum error correcting codes: an overview
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
- The degeneracy problem of two-dimensional linear recurring arrays
- Multidimensional linear complexity analysis of periodic arrays
- Finding a Gröbner basis for the ideal of recurrence relations on \(m\)-dimensional periodic arrays
- Solving a congruence on a graded algebra by a subresultant sequence and its application
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Recovering highly-complex linear recurrences of integer sequences
- Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring
- Guessing Gröbner bases of structured ideals of relations of sequences
- Linear feedback shift registers and the minimal realization problem
- Polynomial-division-based algorithms for computing linear recurrence relations
- scientific article; zbMATH DE number 177894 (Why is no real title available?)
- scientific article; zbMATH DE number 4104858 (Why is no real title available?)
- A behavioral approach to identifiability of 2D scalar systems
- Recursive partial realization for 2-D data arrays
- Polynomial-exponential decomposition from moments
- Finding recursions for multidimensional arrays
- scientific article; zbMATH DE number 4105101 (Why is no real title available?)
- Sparse FGLM algorithms
- Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
- On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
- Linear recurring sequences over modules
- Gröbner basis approach to list decoding of algebraic geometry codes
- On evaluating multivariate polynomials over finite fields
- scientific article; zbMATH DE number 17846 (Why is no real title available?)
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I
- scientific article; zbMATH DE number 617130 (Why is no real title available?)
- Linear recurring sequences over rings and modules
- Algorithms for linearly recurrent sequences of truncated polynomials
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)
