A new memoryless algorithm for de Bruijn sequences

DOI10.1016/0196-6774(81)90007-9MaRDI QIDQ3912587zbMATH OpenOpenAlexFDO

Authors Anthony Ralston

Publication date 1981

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(81)90007-9

zbMATH Keywords

recursive algorithmde Bruijn sequencesfull cycles

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Algorithms in computer science (68W99)

Cited in

(8)

• Decoding structured light patterns for three-dimensional imaging systems
• A simple shift rule for \(k\)-ary de Bruijn sequences
• An efficient generalized shift-rule for the prefer-max de Bruijn sequence
• Test sequence construction using minimum information on the tested system
• Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
• A surprisingly simple de Bruijn sequence construction
• Investigating the discrepancy property of de Bruijn sequences
• A framework for constructing de Bruijn sequences via simple successor rules

This page was built for publication: A new memoryless algorithm for de Bruijn sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3912587)