Strong deviations from randomness in m-sequences based on trinomials

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Strong deviations from randomness in m-sequences based on trinomials

Full text

Pdf (268 KB)

Source

ACM Transactions on Modeling and Computer Simulation (TOMACS) archive
Volume 6 , Issue 2 (April 1996) table of contents

Pages: 99 - 106

Year of Publication: 1996

ISSN:1049-3301

Authors

Makoto Matsumoto	Keio Univ., Yokohama, Japan
Yoshiharu Kurita	National Research Lab. of Metrology, Ibaraki, Japan

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 33, Citation Count: 5

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/232807.232815 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	COMPAGNER, A. 1991.The hierarchy of correlations in random binary sequences. J. Star. Phys. 63, 883-896.
	2	FREDRICSSON, S.A. 1975. Pseudo-randomness properties of binary shift register sequences. IEEE Trans. Inf. Theory 21, 115-120.
	3	Solomon W. Golomb , Soloman Golomb, Shift Register Sequences, Aegean Park Press, Laguna Hills, CA, 1981
	4	HERINGA, J. R., BLOTE, W. J., AND COMPAGNER, A. 1992. New primitive trinomials of Merserme-exponent degrees for random-number generation. Int. J. Mod. Phys. C 3, 561-564.
	5	KURITA, Y., AND MATSUMOTO, M. 1991. Primitive t-nomial (t = 3, 5) over GF(2) whose degree is a Mersenne exponent -< 44497. Math. Comput. 56, 817-821.
	6	LINDHOLM, J.H. 1968. An analysis of the pseudo-randomness properties of subsequences of long m-sequences. IEEE Trans. Inf. Theory 14, 569-576.
	7	Makoto Matsumoto , Yoshiharu Kurita, Twisted GFSR generators II, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.4 n.3, p.254-266, July 1994 [doi>10.1145/189443.189445]
	8	Shu Tezuka , Pierre L'Ecuyer, Efficient and portable combined Tausworthe random number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.1 n.2, p.99-112, April 1991 [doi>10.1145/116890.116892]
	9	WANG, D. K., AND COMPAGNER, A. 1993. On the use of reducible polynomials as random number generators. Math. Comput. 60, 363-374.
	10	WILLETT, M. 1975. Cycle representatives for minimal cyclic codes. IEEE Trans. Inf. Theory 21, 716-718.
	11	WILLETT, M. 1976. Characteristic m-Sequences. Math. Comput. 30, 306-311.

CITED BY 5

	Makoto Matsumoto , Takuji Nishimura, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.8 n.1, p.3-30, Jan. 1998
	Takuji Nishimura, Tables of 64-bit Mersenne twisters, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.10 n.4, p.348-357, Oct. 2000
	Pierre L'Ecuyer, Uniform random number generators: a review, Proceedings of the 29th conference on Winter simulation, p.127-134, December 07-10, 1997, Atlanta, Georgia, United States
	François Panneton , Pierre L'ecuyer , Makoto Matsumoto, Improved long-period generators based on linear recurrences modulo 2, ACM Transactions on Mathematical Software (TOMS), v.32 n.1, p.1-16, March 2006
	Pierre L'Ecuyer , François Panneton, Fast random number generators based on linear recurrences modulo 2: overview and comparison, Proceedings of the 37th conference on Winter simulation, December 04-07, 2005, Orlando, Florida