| F[x]-lattice basis reduction algorithm and multisequence synthesis |
| |
| 作者姓名： | 王丽萍 祝跃飞 |
| |
| 基金项目： | This work was supported by the National Natural Science Foundation of China (Grant Nos. 19931010, G1999035804). |
| |
| 摘 要： | By means of Fx]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback shift registers (or minimal polynomials) for the given mul-tiple sequences over a field F. Its computational complexity is O(N2) operations in F where N is the length of each sequence. A necessary and sufficient condition for the uniqueness of minimal polynomi-als is given. The set and exact number of all minimal polynomials are also described when F is a finite field.
|
F[x]-lattice basis reduction algorithm and multisequence synthesis |
| |
| WANG Liping,& ZHU Yuefei.F[x]-lattice basis reduction algorithm and multisequence synthesis[J].Science in China(Information Sciences),2001,44(5). |
| |
| Authors: | WANG Liping & ZHU Yuefei |
| |
| Affiliation: | Department of Applied Mathematics,information Engineering University,Zhengzhou 450002,China;State Key Laboratory of Information Security,Beijing 100039,China |
| |
| Abstract: | By means of Fx]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback shift registers (or minimal polynomials) for the given mul-tiple sequences over a field F. Its computational complexity is O(N2) operations in F where N is the length of each sequence. A necessary and sufficient condition for the uniqueness of minimal polynomi-als is given. The set and exact number of all minimal polynomials are also described when F is a finite field. |
| |
| Keywords: | multisequence shift-register synthesis F[x]-lattice basis reduction algorithm reduced basis normal reduced basis |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
