Double Adjacencies Between Cycles of a Circulating Shift Register
From MaRDI portal
Publication:5684967
DOI10.1109/T-C.1973.223622zbMath0266.94024MaRDI QIDQ5684967
Publication date: 1973
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
An algorithm for generating necklaces of beads in two colors, A class of nonlinear de Bruijn cycles, Universal circuit matrix for adjacency graphs of feedback functions, Gray codes for reflection groups, A number theoretic view on binary shift registers, Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs, Properties of the cycles that contain all vectors of weight \(\le k\)