Article
Pseudo-Randomness of Quadratic Generators
Authors
and
Abstract
Let xn, n = 0, 1, . . . , M − 1, be a sequence produced by quadratic generator ax2 + bx + c (mod M). In this paper we describe a new method which gives a new bound for discrepancy DM (xn, xn+1). The analysis is restricted by the case of xn with maximal period length M.
Keywords
Pseudo-randomness, quadratic generator, discrepancy.
Citation
Blazekova, O. & Strauch, O. (2007). Pseudo-randomness of quadratic generators. Uniform Distribution Theory, 2(2), 105–120.
O. Blazekova and O. Strauch, “Pseudo-randomness of quadratic generators,” Uniform Distribution Theory, vol. 2, no. 2, pp. 105–120, 2007.
Blazekova O, Strauch O. Pseudo-randomness of quadratic generators. Uniform Distribution Theory. 2007;2(2):105–120.
Blazekova, O. and Strauch, O. (2007), ‘Pseudo-randomness of quadratic generators’, Uniform Distribution Theory, 2(2), pp. 105–120.
Blazekova, Olga, and Oto Strauch. “Pseudo-randomness of Quadratic Generators.” Uniform Distribution Theory, vol. 2, no. 2, 2007, pp. 105–120.
Blazekova, Olga, and Oto Strauch. “Pseudo-randomness of Quadratic Generators.” Uniform Distribution Theory 2, no. 2 (2007): 105–120.
Export citation
Published by: Engineering Journals
