CONSTRUCTING AND ANALYSING A CLASS OF CONTROLLABLE SEQUENCES

Feng Dengguo; Xiao Guozhen

Volume 17 Issue 2

Mar. 1995

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1995 > 17(2): 140-144

Feng Dengguo, Xiao Guozhen. CONSTRUCTING AND ANALYSING A CLASS OF CONTROLLABLE SEQUENCES[J]. Journal of Electronics & Information Technology, 1995, 17(2): 140-144.

Citation:

Feng Dengguo, Xiao Guozhen. CONSTRUCTING AND ANALYSING A CLASS OF CONTROLLABLE SEQUENCES[J]. Journal of Electronics & Information Technology, 1995, 17(2): 140-144.

Feng Dengguo, Xiao Guozhen. CONSTRUCTING AND ANALYSING A CLASS OF CONTROLLABLE SEQUENCES[J]. Journal of Electronics & Information Technology, 1995, 17(2): 140-144.

Citation:

Feng Dengguo, Xiao Guozhen. CONSTRUCTING AND ANALYSING A CLASS OF CONTROLLABLE SEQUENCES[J]. Journal of Electronics & Information Technology, 1995, 17(2): 140-144.

PDF( 670 KB)

CONSTRUCTING AND ANALYSING A CLASS OF CONTROLLABLE SEQUENCES

Received Date: 1993-09-03
Rev Recd Date: 1994-05-06
Publish Date: 1995-03-19

Abstract

Abstract

Using m-sequence over the finite field GF(2m) of degree L to controll m-sequence over GF(2m) of degree L, a class of periodic sequences with large linear complexity is constructed. The lower bounds of the linear complexity of the sequences are L((L+1)m- Lm).

FullText(HTML)

References(1)

References

肖国镇,梁传甲,王育民.伪随机序列及其应用.北京:国防工业出版社,1985,第二章.[2]万哲先.代数和编码.北京:科学出版社,1980,第三章.[3]Lennart Brynielasou.[J].On the Linear Complexity of Combined Shift Register Sequences. Advances in Cryptology-EUROCRYPTO85, Springer-verlag.1985,:-[4]孙登峰.密码与信息,1991,(3): 1-18.

Relative Articles

Supplements(0)

Cited By

Proportional views