Title :
Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
Author :
Mykkeltveit, Johannes
Author_Institution :
Department of Mathematics, University of Bergen
fDate :
3/1/1975 12:00:00 AM
Abstract :
Magleby [6] proved that there can exist at most two adjacencies between a pair of cycles of a pure circulating register. We give a theorem (Theorem 1) for construction of all such pairs of cycles, and our theorem enables us to count them.
Keywords :
Adjacency diagram, adjacent cycles, binary cycle, de Bruijn graph, feedback shift register.; Feedback; Helium; Mathematics; Shift registers; Adjacency diagram, adjacent cycles, binary cycle, de Bruijn graph, feedback shift register.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1975.224210
