Information Technology Reference
In-Depth Information
References
1. Antoulas, A.C.: On recursiveness and related topics in linear systems. IEEE Trans.
Automat. Control 31(12), 1121-1135 (1986)
2. Antoulas, A.C.: Recursive modeling of discrete-time time series. In: Van Dooren,
P., Wyman, B. (eds.) Linear Algebra for Control Theory, IMA, vol. 62, pp. 1-20
(1994)
3. Bultheel, A., De Moor, B.: Rational approximation in linear systems and control.
J. Comput. Appl. Math. 121, 355-378 (2000)
4. Dawson, E., Simpson, L.: Analysis and design issues for synchronous stream ci-
phers. In: Niederreiter, H. (ed.) Coding Theory and Cryptology, pp. 49-90. World
Scientific, Singapore (2002)
5. Dickinson, B.W., Morf, M., Kailath, D.: A minimal realization algorithm for matrix
sequences. IEEE Trans. Automat. Control 19(1), 31-38 (1974)
6. Ding, C.S.: Proof of Massey's conjectured algorithm, Advances in Cryptology.
LNCS, vol. 330, pp. 345-349. Springer, Berlin (1988)
7. ECRYPT stream cipher project,
http://www.ecrypt.eu.org/stream
8. Feng, G.L., Tzeng, K.K.: A generalization of the Berlekamp-Massey algorithm for
multisequence shift-register synthesis with applications to decoding cyclic codes.
IEEE Trans. Inform. Theory 37, 1274-1287 (1991)
9. Forney, G.D.: Minimal bases of rational vector spaces, with applications to multi-
variable linear systems. SIAM J. Control 13, 493-520 (1975)
10. Gragg, W.B., Lindquist, A.: On the partial realization problem. Linear Alg.
Appl. 50, 277-319 (1983)
11. Hawkes, P., Rose, G.G.: Exploiting multiples of the connection polynomial in word-
oriented stream ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976,
pp. 303-316. Springer, Heidelberg (2000)
12. Kalman, R.E.: On minimal partial realizations of a linear input/output map. In:
Kalman, R.E., DeClaris, N. (eds.) Aspects of network and System Theory, New
York, pp. 385-407 (1971)
13. Kuijper, M.: An algorithm for constructing a minimal partail realization in the
multivariable case. Syst. Contr. Lett. 31, 225-233 (1997)
14. Lenstra, A.K.: Factoring multivariate polynomials over finite fields. J. Comp. Sys.
Sci. 30, 235-248 (1985)
15. Mahler, K.: An analogue to Minkowski's geometry of numbers in a field of series.
Ann. of Math. 42, 488-522 (1941)
16. Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inform. The-
ory 15(1), 122-127 (1969)
17. Schmidt, W.M.: Construction and estimation of bases in function fields. J. Number
Theory 39, 181-224 (1991)
18. Van Barel, M., Bultheel, A.: A generalized minimal partial realization problem.
Linear Alg. Appl. 254, 527-551 (1997)
19. Wang, L.-P., Zhu, Y.-F.:
F
[
x
]-lattice basis reduction algorithm and multisequence
synthesis. Science in China (Series F) 44, 321-328 (2001)
20. Wang, L.-P., Zhu, Y.-F., Pei, D.-Y.: On the lattice basis reduction multisequence
synthesis algorithm. IEEE Trans. Inform. Theory 50, 2905-2910 (2004)
