Name
Abstract | ||
|---|---|---|
On the linear complexity Λ(z) of a periodically repeated random bit sequence z, R. Rueppel proved that, for two extreme cases of the period T, the expected linear complexity E[Λ(z)] is almost equal to T, and suggested that E[Λ(Z)] would be close to T in general [6, pp. 33- 52] [7, 8]. In this note we obtain bounds of E[Λ(Z)], as well as bounds of the variance Var[Λ(Z)], both for the general case of T, and we estimate the probability distribution of Λ(Z). Our results on E[Λ(Z)] quantify the closeness of E[Λ(Z)] and T, in particular, formally confirm R. Rueppel's suggestion. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/3-540-46416-6_15 | EUROCRYPT |
Keywords | Field | DocType |
linear complexity,expected linear complexity e,variance var,random bit sequence,extreme case,general case,random sequence,probability distribution | Discrete mathematics,Combinatorics,Probability distribution,Linear complexity,Mathematics | Conference |
Volume | ISSN | ISBN |
547 | 0302-9743 | 3-540-54620-0 |
Citations | PageRank | References |
10 | 0.77 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zong-duo Dai | 1 | 203 | 25.53 |
| Jun-Hui Yang | 2 | 47 | 4.28 |