Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
type: Item
instance of: scholarly article
title: Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
zbMATH Open document ID: 0647.68044
DOI: 10.1016/S0747-7171(88)80033-6
author: Shojiro Sakata
published in: Journal of Symbolic Computation
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 11T99
Mathematics Subject Classification ID: 94B40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4057003
zbMATH Keywords: linear recurring relations
zbMATH Keywords: finite two-dimensional array
zbMATH Keywords: Berlekamp- Massey algorithm
zbMATH Keywords: linear feedback shift-register
zbMATH Keywords: complexity of computation
zbMATH Keywords: Gröbner bases
zbMATH Keywords: polynomial ideals
MaRDI profile type: Publication
cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
cites work: Q3714165
cites work: A theory of two-dimensional cyclic codes
cites work: Shift-register synthesis and BCH decoding
cites work: Impulse response arrays of discrete-space systems over a finite field
cites work: General theory of doubly periodic arrays over an arbitrary finite field and its applications
cites work: On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
description: scientific article; zbMATH DE number 4057003