A linear algebraic approach to multisequence shift-register synthesis (Q764390)

The authors present a shift-register synthesis algorithm determining the joint linear complexity and a joint minimal polynomial for \(K\) parallel sequences not necessarily of the same length in \(O(KN^2)\) operations if \(N\) is the length of the longest sequence. A criterion for the uniqueness of the joint minimal polynomial is given. Various algorithms for the same (and even more general) problems have been presented earlier, for instance in [\textit{G.-L. Feng} and \textit{K. K. Tzeng}, IEEE Trans. Inf. Theory 37, No. 5, 1274--1287 (1991; Zbl 0734.94008); \textit{L. Wang}, Finite Fields Appl. 14, No. 4, 979--991 (2008; Zbl 1179.11050); \textit{L.-P. Wang}, Cryptogr. Commun. 3, No. 1, 29--42 (2011; Zbl 1235.94043)].