A new memoryless algorithm for de Bruijn sequences

DOI10.1016/0196-6774(81)90007-9zbMath0463.05006OpenAlexW2021003109MaRDI QIDQ3912587

A. 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

de Bruijn sequencesrecursive algorithmfull cycles

Mathematics Subject Classification ID

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

Related Items (8)

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

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