A Gröbner basis and a minimal polynomial set of a finite nD array
Author:
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 280-291
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithmIEEE Transactions on Information Theory, 1991
- Extension of the Berlekamp-Massey algorithm to N dimensionsInformation and Computation, 1990
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional arrayJournal of Symbolic Computation, 1988
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory1985
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their dualsIEEE Transactions on Information Theory, 1981
- General theory of doubly periodic arrays over an arbitrary finite field and its applicationsIEEE Transactions on Information Theory, 1978
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969