DocumentCode
1117786
Title
Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
Author
Mykkeltveit, Johannes
Author_Institution
Department of Mathematics, University of Bergen
Issue
3
fYear
1975
fDate
3/1/1975 12:00:00 AM
Firstpage
299
Lastpage
304
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.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1975.224210
Filename
1672803
Link To Document