Finding recursions for multidimensional arrays
type: Item
instance of: scholarly article
title: Finding recursions for multidimensional arrays
zbMATH Open document ID: 1021.94028
author: Oliver Pretzel
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94B27
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1853237
zbMATH Keywords: Berlekamp-Massy algorithm
zbMATH Keywords: Sakata's algorithm
zbMATH Keywords: recursion relations
zbMATH Keywords: recursive array
MaRDI profile type: Publication
full work available at URL: inco.2001.2965
OpenAlex ID: W2003098720
cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
cites work: Shift-register synthesis and BCH decoding
cites work: Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
cites work: Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
cites work: Extension of the Berlekamp-Massey algorithm to N dimensions
cites work: Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
DOI: 10.1006/INCO.2001.2965
description: scientific article; zbMATH DE number 1853237