This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
March 1975 (vol. 24 no. 3)
pp. 299-304
J. Mykkeltveit, Department of Mathematics, University of Bergen
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.
Index Terms:
Adjacency diagram, adjacent cycles, binary cycle, de Bruijn graph, feedback shift register.
Citation:
J. Mykkeltveit, "Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register," IEEE Transactions on Computers, vol. 24, no. 3, pp. 299-304, March 1975, doi:10.1109/T-C.1975.224210
Usage of this product signifies your acceptance of the Terms of Use.