𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Statistical complexity measure of pseudorandom bit generators

✍ Scribed by C.M. González; H.A. Larrondo; O.A. Rosso

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
688 KB
Volume
354
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Intensive statistical complexity measure
Intensive statistical complexity measure of pseudorandom number generators
✍ H.A. Larrondo; C.M. González; M.T. Martín; A. Plastino; O.A. Rosso 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 245 KB

A Statistical Complexity measure has been recently proposed to quantify the performance of chaotic Pseudorandom number generators (PRNG) (Physica A 354 (2005) 281). Here we revisit this quantifier and introduce two important improvements: (i) consideration of an intensive statistical complexity (Phy

A statistical measure of complexity
A statistical measure of complexity
✍ R. López-Ruiz; H.L. Mancini; X. Calbet 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 504 KB
A statistical measure of complexity with
A statistical measure of complexity with nonextensive entropy
✍ Takuya Yamano 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 217 KB

A statistical measure of complexity utilising the concept of entropy or information is proposed. Our way in this study is to use a nonextensive entropy instead of an extensive (additive) Shannon entropy in the deÿnition, but can be characterised as a di erence between the qth-order RÃ enyi entropy a