Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
From MaRDI portal
Publication:4053495
DOI10.1109/T-C.1975.224210zbMath0298.94038MaRDI QIDQ4053495
Publication date: 1975
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
An algorithm for generating necklaces of beads in two colors ⋮ On the cycles and adjacencies in the complementary circulating register ⋮ On the classification of deBruijn sequences ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ A class of nonlinear de Bruijn cycles ⋮ On the structure property of PCR's adjacency graph with a prime order and its application of constructing M-sequences ⋮ The analysis of de Bruijn sequences of non-extremal weight ⋮ A number theoretic view on binary shift registers ⋮ Universal circuit matrix for adjacency graphs of feedback functions
This page was built for publication: Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
