An efficient algorithm for the generation of DeBruijn cycles

DOI10.1109/18.133272zbMath0734.94009OpenAlexW1966042291MaRDI QIDQ3363230

Wouter G. Franx, Cees J. A. Jansen, D. E. Boekee

Publication date: 1991

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.133272

zbMATH Keywords

feedback shift registerscycle joininggeneration of binary DeBruijn sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (14)

Cryptographically Strong de Bruijn Sequences with Large Periods ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ Construction for de Bruijn sequences with large stage ⋮ De Bruijn sequences, irreducible codes and cyclotomy ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ Preliminary results on the minimal polynomial of modified de Bruijn sequences ⋮ An interleaved method for constructing de Bruijn sequences ⋮ The adjacency graphs of some feedback shift registers ⋮ Test sequence construction using minimum information on the tested system ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ Investigating the discrepancy property of de Bruijn sequences ⋮ A number theoretic view on binary shift registers ⋮ Novel way to research nonlinear feedback shift register

This page was built for publication: An efficient algorithm for the generation of DeBruijn cycles