Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence

DOI10.1109/18.59953zbMath0713.94012OpenAlexW2085768592MaRDI QIDQ3199325

Patrick Fitzpatrick, Graham H. Norton

Publication date: 1990

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.59953

zbMATH Keywords

characteristic polynomialscharacteristic idealdoubly periodic arraysn-dimensional linear recurring sequence

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclic codes (94B15)

Related Items

Polynomial-division-based algorithms for computing linear recurrence relations, Polynomial-exponential decomposition from moments, Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants