| LINEAR COMPLEXITY AND RANDOM SEQUENCES WITH PERIOD 2~n |
| |
| 引用本文： | 章照止,杨义先. LINEAR COMPLEXITY AND RANDOM SEQUENCES WITH PERIOD 2~n[J]. 系统科学与复杂性, 1990, 0(2) |
| |
| 作者姓名： | 章照止 杨义先 |
| |
| 作者单位： | Institute of Systems Science Academia Sinica，Beijing，China，Beijing University of Posts & Telecommunications，Beijing，China |
| |
| 基金项目： | This project was supported by National Natural Science Foundation of China |
| |
| 摘 要： | ![]()
Let (?)=(S,S,…)be a binary random sequence with period N=2~n,where S=(S_0,…,S_(N-1))is its one period with N independent and uniformly distributed binary random variables.The main results of this paper are as follows.1)Var c(?)=2-(2N+1)2~(-N)-2~(-2N);2)E|c(?)-c(?)|=[2~(c(?)+1)-2]2~(-N)for any sequence (?) with period 2~n;3)N-1+2~(-N)-(n/2+1-2~(-(N-n)))≤E[(?)c(?)]≤N-1+2~(-N)4)2-2~(-(N-1))≤E[(?)|c(?)-c(?)|]≤2-2~(-N)+n/2-2~(-(N-n)),where E and Var stand for taking expectation and variance respectively,c(?) is the linearcomplexity of the sequence (?) and W(b) the Hamming weight of one period of the seqnence (?).
|
LINEAR COMPLEXITY AND RANDOM SEQUENCES WITH PERIOD 2~n |
| |
| Zhang Zhaozhi. LINEAR COMPLEXITY AND RANDOM SEQUENCES WITH PERIOD 2~n[J]. Journal of Systems Science and Complexity, 1990, 0(2) |
| |
| Authors: | Zhang Zhaozhi |
| |
| Abstract: | ![]()
|
| |
| Keywords: | Linear complexity Boolean funcation random sequence local complementation |
| 本文献已被 CNKI 等数据库收录！ |
