Generators for sequences with near-maximal linear equivalence

A modification of Rueppel´s concept of self-decimating sequences enables the design of binary self-clocked linear feedback shift registers of prime period. These in turn may be used as stages in Gollmann´s cascade of clock-controlled registers to produce sequences with linear equivalence and period comparable to an upper bound determined by the total number of storage elements.