scientific article; zbMATH DE number 4105101
From MaRDI portal
Publication:3829641
computational complexitycyclic codesmultisequencesabelian codesBerlekamp-Massey algorithmn-dimensional arraysGröbner bases of idealsminimal set of linear recurring relations
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Cyclic codes (94B15) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
Recommendations
- Extension of the Berlekamp-Massey algorithm to N dimensions
- scientific article; zbMATH DE number 177894
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- scientific article; zbMATH DE number 17846
Cited in
(6)- Finding a Gröbner basis for the ideal of recurrence relations on \(m\)-dimensional periodic arrays
- Extension of the Berlekamp-Massey algorithm to N dimensions
- scientific article; zbMATH DE number 177894 (Why is no real title available?)
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- scientific article; zbMATH DE number 17846 (Why is no real title available?)
- Applications of the theory of Gröbner bases to the study of linear recurring arrays
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829641)
