THE PERIOD AND THE LINEAR COMPLEXITY OF CERTAIN LINEAR RECURRING SEQUENCES IN THE FINITE FIELD GF(q)

In this paper we will prove some theorems on the period and the linear complexity of certain sequences in GF(q) which are generated by combining two sequences in a reasonable way. In fact these theorems are generalizations of the main result in [1]. A sequence of elements of GF(2) is called a binary sequence. In recent years considerable interest has been shown in the generation of binary sequences which have good properties. Such binary sequences play an important role in a stream cipher system.

(0)

(0)

(0)

(0)