Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
Johannes Mykkeltveit · IEEE Transactions on Computers · 1975
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.