A new class of 2/sup N/-ary sequences: construction and properties

A class of 2^N-ary sequences, called L-sequences, of period (2^N)ⁱ - 1 with each sequence symbol from the composite field GF((2^m)^t) is constructed, where N = mt for Some integers m, t and i = 1 , 2 , , , , , t. An L-sequence of length (2^N)ⁱ - 1 is obtained through the linear recursion resulted from a linear feedback shift register that is specified by a primitive polynomial of degree i over GF((2^m)^t), where i = 1,2, . . . , t. Each symbol in an L-sequence is also given a matrix representation. Further, some interesting properties of the class of L-sequences are presented.