Issue No. 03 - March (1975 vol. 24)
J. Mykkeltveit , Department of Mathematics, University of Bergen
Magleby  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.
Adjacency diagram, adjacent cycles, binary cycle, de Bruijn graph, feedback shift register.
J. Mykkeltveit, "Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register," in IEEE Transactions on Computers, vol. 24, no. , pp. 299-304, 1975.