An algorithm for constructing m-ary de Bruijn sequences

DOI10.1016/0196-6774(86)90025-8zbMath0619.68060OpenAlexW1990570130MaRDI QIDQ3756535

Tuvi Etzion

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90025-8

zbMATH Keywords

algorithmgeneration of m-ary de Bruijn cycles

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Discrete mathematics in relation to computer science (68R99)

Related Items (10)

An efficient shift rule for the prefer-max de Bruijn sequence ⋮ An algorithm for generating shift-register cycles ⋮ Perfect factors in the de Bruijn graph ⋮ New classes of perfect maps. I ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ Construction of infinite de Bruijn arrays ⋮ Linearization of multi-valued nonlinear feedback shift registers ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Test sequence construction using minimum information on the tested system ⋮ On stability of multi-valued nonlinear feedback shift registers

This page was built for publication: An algorithm for constructing m-ary de Bruijn sequences