Name
Abstract | ||
|---|---|---|
AbstractPseudorandom binary sequences play a significant role in many fields, such as spread spectrum communications, stochastic computation, and cryptography. The complexity measures of sequences and their relationship still remain an interesting open problem. In this article, we study on the eigenvalue of random sequences, deduce its theoretical expectation and variance of random sequences with length N, and establish the relationship between eigenvalue and Shannon's entropy. The results show that these two measures are consistent. Furthermore, the eigenvalue of random n-block sequences and its relation to Shannon's entropy are also been studied. © 2014 Wiley Periodicals, Inc. Complexity 21: 154-161, 2015 |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1002/cplx.21587 | Periodicals |
Keywords | Field | DocType |
random sequence,eigenvalue,entropy | Entropy power inequality,Discrete mathematics,Combinatorics,Transfer entropy,Open problem,Random sequence,Rényi entropy,Binary entropy function,Shannon's source coding theorem,Mathematics,Pseudorandom number generator | Journal |
Volume | Issue | ISSN |
21 | 2 | 1076-2787 |
Citations | PageRank | References |
2 | 0.41 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lingfeng Liu | 1 | 108 | 11.92 |
| Suoxia Miao | 2 | 43 | 5.64 |
| Hanping Hu | 3 | 178 | 18.63 |
| Ya Shuang Deng | 4 | 43 | 3.43 |