论文信息 - Intensive statistical complexity measure of pseudorandom number generators

Intensive statistical complexity measure of pseudorandom number generators

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 (Physica A 334 (2004) 119), and (ii) following the prescription of Brand and Pompe (Phys. Rev. Lett. 88 (2002) 174102-1) in evaluating the probability distribution associated with the PRNG. The ensuing new measure is applied to a very well-tested PRNG advanced by Marsaglia.

Osvaldo A. Rosso | Hilda A. Larrondo | A. R. Plastino | María Teresa Martín | C. M. González

[1] Osvaldo A. Rosso,et al. Intensive entropic non-triviality measure , 2004 .

[2] Osvaldo A. Rosso,et al. Statistical complexity and disequilibrium , 2003 .

[3] P. Landsberg,et al. Simple measure for complexity , 1999 .

[4] Karsten Keller,et al. Symbolic Analysis of High-Dimensional Time Series , 2003, Int. J. Bifurc. Chaos.

[5] B. Pompe,et al. Permutation entropy: a natural complexity measure for time series. , 2002, Physical review letters.

[6] Osvaldo A. Rosso,et al. Statistical complexity measure of pseudorandom bit generators , 2005 .