The orders of equidistribution of subsequences of every nth term of the asymptotically random sequence given by Tootill, Robinson, and Eagle [5], and of six other asymptotically random sequences, were determined for various values of n and of the number of bits to which each term in the sequence is read. Deficiencies in equidistribution were found to be small enough to qualify the sequences for use in applications with fixed, as well as variable, dimensionality requirements. An improved initialization algorithm is also given.
The orders of equidistribution of subsequences of some asymptotically random sequences
The Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment