Finding recursions for multidimensional arrays

DOI10.1006/INCO.2001.2965MaRDI QIDQ1854502zbMATH OpenOpenAlexFDO

Authors Oliver Pretzel

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.2001.2965

zbMATH Keywords

Berlekamp-Massy algorithmrecursion relationsrecursive arraySakata's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• Extension of the Berlekamp-Massey algorithm to N dimensions
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
• Polynomial-division-based algorithms for computing linear recurrence relations
• scientific article; zbMATH DE number 177894
• Finding a Gröbner basis for the ideal of recurrence relations on m-dimensional periodic arrays

Cites work

• Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Extension of the Berlekamp-Massey algorithm to N dimensions
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• Shift-register synthesis and BCH decoding

Cited in

(2)

• Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields
• scientific article; zbMATH DE number 7120968 (Why is no real title available?)

This page was built for publication: Finding recursions for multidimensional arrays

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