Randomness of D Sequences via Diehard Testing

Abstract

This paper presents a comparison of the quality of randomness of D sequences based on diehard tests. Since D sequences can model any random sequence, this comparison is of value beyond this specific class.

Cited by in corpus (5)

• A Wireless System Using Random Residue Sequences
• First derivatives at the optimum analysis (\textit{fdao}): An approach to estimate the uncertainty in nonlinear regression involving stochastically independent variables
• New Class of Pseudorandom D-sequences to Generate Cryptographic Keys
• A New Result on the Random Residue Sequence Algorithm
• Survey of Key Distribution Schemes for Wireless Sensor Networks