Strong deviations from randomness in m -sequences based on trinomials
- 1 April 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 6 (2) , 99-106
- https://doi.org/10.1145/232807.232815
Abstract
The fixed vector of any m -sequence based on a trinomial is explicitly obtained. Local nonrandomness around the fixed vector is analyzed through model-construction and experiments. We conclude that the initial vector near the fixed vector should be avoided.Keywords
This publication has 8 references indexed in Scilit:
- Twisted GFSR generators IIACM Transactions on Modeling and Computer Simulation, 1994
- On the use of reducible polynomials as random number generatorsMathematics of Computation, 1993
- NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATIONInternational Journal of Modern Physics C, 1992
- The hierarchy of correlations in random binary sequencesJournal of Statistical Physics, 1991
- Efficient and portable combined Tausworthe random number generatorsACM Transactions on Modeling and Computer Simulation, 1991
- Cycle representatives for minimal cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1975
- Pseudo-randomness properties of binary shift register sequences (Corresp.)IEEE Transactions on Information Theory, 1975
- An analysis of the pseudo-randomness properties of subsequences of longm-sequencesIEEE Transactions on Information Theory, 1968