Computing and listing of number of possible m-sequence generators of order n

Design of maximal length sequence (m-sequence) generators of order n has many controlling parameters. In the design process of the generators it is essential to ensure that the generator characteristic polynomial corresponds to a primitive polynomial. The complexity of the search problem of primitive polynomials of order n grows as n increases and hence restricts the listing of all parameters of m-sequence generators of order n. This paper presents a computational procedure to determine the number of possible generators of order n. The paper provides a list of all possible m-sequence generators for up to n = 100.