The Community for Technology Leaders
Green Image
Issue No. 03 - March (1975 vol. 24)
ISSN: 0018-9340
pp: 299-304
J. Mykkeltveit , Department of Mathematics, University of Bergen
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.
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. , pp. 299-304, March 1975, doi:10.1109/T-C.1975.224210
100 ms
(Ver 3.3 (11022016))