Self-dual sequences

DOI10.1016/0097-3165(87)90035-5zbMath0617.05010OpenAlexW2039807365MaRDI QIDQ1821784

Tuvi Etzion

Publication date: 1987

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(87)90035-5

zbMATH Keywords

de Bruijn sequencesfeedback shift registerself-dual sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Discrete mathematics in relation to computer science (68R99)

Related Items (5)

Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ Investigating the discrepancy property of de Bruijn sequences

Cites Work

• The enumeration of shift register sequences
• An algorithm for generating shift-register cycles
• On the parity of the frequency of cycle lengths of shift register sequences
• Non-Linear Recursive Sequences
• Algorithms for the generation of full-length shift- register sequences
• Construction of de Bruijn sequences of minimal complexity
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Asymptotic behavior of Golomb's Z(n) conjecture (Corresp.)
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

This page was built for publication: Self-dual sequences