THE COMPLEXITY OF ONE PERIOD OF AN M-SEQUENCE

Xing Chao-ping, Xiao Guo-zhen, Feng Kei-qin

Acta Mathematicae Applicatae Sinica ›› 1991, Vol. 14 ›› Issue (2) : 257-261.

PDF(286 KB)
中国科学院数学与系统科学研究院期刊网
PDF(286 KB)
Acta Mathematicae Applicatae Sinica ›› 1991, Vol. 14 ›› Issue (2) : 257-261. DOI: 10.12387/C1991036

THE COMPLEXITY OF ONE PERIOD OF AN M-SEQUENCE

  • Xing Chao-ping, Xiao Guo-zhen, Feng Kei-qin
Author information +
History +

Abstract

One period of an M-sequence is an important finite sequence. In this paper, we discuss its complexity from three aspects——upper and lower bounds, ergodicity and distribution.

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
Xing Chao-ping, Xiao Guo-zhen, Feng Kei-qin. THE COMPLEXITY OF ONE PERIOD OF AN M-SEQUENCE. Acta Mathematicae Applicatae Sinica, 1991, 14(2): 257-261 https://doi.org/10.12387/C1991036

References

[1] Rainer A. Rueppel, Linear Complexity and Random Sequences, Eurocrpt 85, 167-188.
[2] A. H. Chan, R. A. Games and E. L. Key, On the Complexities of de Bruijn Sequences, Journal of Combinatorial Theory, Ser. A. 33, (1982), 233-246.
[3] J. L. Massey, Shift-Register Sequence: and BCTI Decoding, IEEE Tranr. On Info. Theory, IT-15,(1969), 122-127.
[4] S. N. Golomb, Shift Register Sequences, Holden-Day, San Francisco, Calif., 1967.
PDF(286 KB)

269

Accesses

0

Citation

Detail
Sections
Recommended

/

〈 〉