An algorithm for constructing m-ary de Bruijn sequences

DOI10.1016/0196-6774(86)90025-8zbMATH Open0619.68060OpenAlexW1990570130MaRDI QIDQ3756535FDOQ3756535

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)

Cited In (14)

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

   Recommendations

• An efficient algorithm for the generation of DeBruijn cycles 👍 👎
• A new algorithm for the generation of binary de Bruijn sequences 👍 👎
• Notes on de Bruijn sequences 👍 👎
• Title not available (Why is that?) 👍 👎
• Algorithms for the generation of full-length shift- register sequences 👍 👎

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

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