A new algorithm for the generation of binary de Bruijn sequences

DOI10.1016/0196-6774(90)90028-DzbMath0696.68043OpenAlexW2027662810MaRDI QIDQ3474273

Yuejiang Huang

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0196-6774(90)90028-d

zbMATH Keywords

de Bruijn sequencescomplementing circulating registerpure cycles

Mathematics Subject Classification ID

Communication, information (94A99) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (10)

Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ A surprisingly simple de Bruijn sequence construction ⋮ The discrepancy of the lex-least de Bruijn sequence ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ A simple shift rule for \(k\)-ary de Bruijn sequences ⋮ Investigating the discrepancy property of de Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences

This page was built for publication: A new algorithm for the generation of binary de Bruijn sequences