The enumeration of shift register sequences

DOI10.1016/0097-3165(83)90004-3zbMath0516.05030OpenAlexW1971123381MaRDI QIDQ1052333

J. Blot

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90004-3

zbMATH Keywords

number of cyclesfeedback shift registerde Bruijn-Good graphnumber of cyclically distinct binary sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (4)

Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs ⋮ Self-dual sequences ⋮ On the number of cyclically distinct binary sequences having no internal periodicity and satisfying certain equality constraints ⋮ The enumeration of shift register sequences

Cites Work

• Unnamed Item
• Unnamed Item
• The enumeration of shift register sequences
• On the number of cyclically distinct binary sequences having no internal periodicity and satisfying certain equality constraints
• m-ary closed sequences
• On extremal factors of the de Bruijn graph
• On k-Stable Feedback Shift Registers
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Nonlinear Feedback Shift Registers
• Normal Recurring Decimals

This page was built for publication: The enumeration of shift register sequences