期刊名称：International Journal of Distributed and Parallel Systems
印刷版ISSN：2229-3957
电子版ISSN：0976-9757
出版年度：2010
卷号：1
期号：2
DOI：10.5121/ijdps.2010.1207
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：This paper discusses the linear complexity property of binary sequences generated using matrix recurrence relation defined over Z4. Generally algorithm to generate random number is based on recursion with seed value/values. In this paper a linear recursion sequence of matrices or vectors over Z4 is generated from which random binary sequence is obtained. It is shown that such sequences have large linear complexity.
关键词：This paper discusses the linear complexity property of binary sequences generated using matrix;recurrence relation defined over Z4. Generally algorithm to generate random number is based on;recursion with seed value/values. In this paper a linear recursion sequence of matrices or vectors over Z4;is generated from which random binary sequence is obtained. It is shown that such sequences have large;linear complexity.
