Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- 30 June 1988
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 5 (3) , 321-337
- https://doi.org/10.1016/s0747-7171(88)80033-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Impulse response arrays of discrete-space systems over a finite fieldIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- 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
- A theory of two-dimensional cyclic codesInformation and Control, 1977
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969