Generation of the Ford sequence of length \(2^ n\), n large

DOI10.1016/0097-3165(72)90091-XzbMath0229.05004OpenAlexW1973220679MaRDI QIDQ2550021

Harold Fredricksen

Publication date: 1972

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(72)90091-x

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (12)

An efficient shift rule for the prefer-max de Bruijn sequence ⋮ Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence ⋮ Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions ⋮ A surprisingly simple de Bruijn sequence construction ⋮ On the de Bruijn torus problem ⋮ A class of nonlinear de Bruijn cycles ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ Lexicographic compositions and de Bruijn sequences ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ A simple shift rule for \(k\)-ary de Bruijn sequences ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Longest subsequences shared by two de Bruijn sequences

Cites Work

• The lexicographically least de Bruijn cycle

This page was built for publication: Generation of the Ford sequence of length \(2^ n\), n large