A Class of Autonomous One-Dimensional Iterative Arrays of Linear Machines
IEEE Transactions on Computers
Particular cycles of a binary de Bruijn digraph
European Journal of Combinatorics
Adjacencies Between the Cycles of a Shift Register with Characteristic Polynomial (1 + x)n
IEEE Transactions on Computers
A recursive construction of nonbinary de Bruijn sequences
Designs, Codes and Cryptography
On extending de Bruijn sequences
Information Processing Letters
| Hi-index | 14.99 |
A homomorphism of the de Bruijn graph that maps a graph of order n onto one of order n-1 and its applications to the design of nonsingular feedback shift registers are discussed. The properties preserved under this mapping suggest a new design technique whose main advantage is due to the fact that the problem of designing a desired n-stage shift register may be reduced to a problem of order n-1 or less. Among the results obtained is a recursive formula for a feedback function that generates a cycle of maximum length.