On Linear Complexity of Binary Sequences Generated Using Matrix Recurrence Relation Defined Over Z4
S Ramesh, K.N. Haribhat, R. Murali · International Journal of Distributed and Parallel systems · 2010
This paper discusses the linear complexity property of binary sequences generated using matrix recurrence relation defined over Z 4. 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 Z 4 is generated from which random binary sequence is obtained.It is shown that such sequences have large linear complexity.