On the lattice basis reduction multisequence synthesis algorithm

IEEE Transactions on Information Theory

Volumn 50, Issue 11, 2004, Pages 2905-2910

  Wang, Li Ping ^a   Zhu, Yue Fei ^b   Pei, Ding Yi ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INFORMATION ENGINEERING UNIVERSITY   (China)

^c GRADUATE SCHOOL   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; VECTORS;

LATTICE BASIS REDUCTION ALGORITHM; MULTISEQUENCE SHIFT REGISTER SYNTHESIS;

INFORMATION THEORY;

EID: 8144226815     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.836670     Document Type: Article

References (9)

1. P. Hawkes and G. G. Rose, "Exploiting multiples of the connection polynomial in word-oriented stream ciphers," in Advances in Cryptology-ASIACRYPT 2000 (Lecture Note in Computer Science), T. Okamoto, Ed. Berlin, Germany: Springer-Verlag, 2000, vol. 1976, pp. 303-316.
2. W. Meidl and H. Niederreiter, "On the expected value of the jointly linear complexity of periodic multisequences," J. Complexity, vol. 19, pp. 61-72, 2003.
3. G. L. Feng and K. K. Tzeng, "A generalized Euclidean algorithm for multisequence shift-register synthesis," IEEE Trans. Inform. Theory, vol. 35, pp. 584-594, May 1989.
4. G. L. Feng, "A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1274-1287, Sept. 1991.
5. A. C. Antoulas, "On recursiveness and related topics in linear systems," IEEE Trans. Automat. Contr., vol. 31, pp. 1121-1135, Dec. 1986.
6. G. H. Norton, "Some decoding applications of minimal realization," in Cryptography and Coding (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 1025, pp. 53-62.
7. L.-P. Wang and Y.-F. Zhu, "F [x]-lattice basis reduction algorithm and multisequence synthesis," Sci. in China, ser. F, vol. 44, pp. 321-328, 2001.
8. C. S. Ding, "Proof of Massey's conjectured algorithm," in Advances in Cryptology (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1988, vol. 330, pp. 345-349.
9. W. M. Schmidt, "Construction and estimation of bases in function fields," J. Number Theory, vol. 39, no. 2, pp. 181-224, 1991.