Finding recursions for multidimensional arrays

DOI10.1006/inco.2001.2965zbMath1021.94028OpenAlexW2003098720MaRDI QIDQ1854502

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

recursion relationsBerlekamp-Massy algorithmrecursive 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)

Related Items

Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields

Cites Work

• 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
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• Shift-register synthesis and BCH decoding