An efficient algorithm for the generation of DeBruijn cycles

DOI10.1109/18.133272MaRDI QIDQ3363230zbMATH OpenOpenAlexFDO

Authors Cees J. A. Jansen, Wouter G. Franx, 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

cycle joiningfeedback shift registersgeneration of binary DeBruijn sequences

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for the generation of full-length shift- register sequences
• A new algorithm for the generation of binary de Bruijn sequences
• scientific article; zbMATH DE number 4045636
• An algorithm for constructing m-ary de Bruijn sequences
• scientific article; zbMATH DE number 500267

Cited in

(33)

• An algorithm for generating shift-register cycles
• Notes on de Bruijn sequences
• Algorithm for the generation of nonlinear de Bruijn sequences
• De Bruijn sequences, irreducible codes and cyclotomy
• Constructing de Bruijn sequences by concatenating smaller universal cycles
• 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
• A framework for constructing de Bruijn sequences via simple successor rules
• An efficiently generated family of binary de Bruijn sequences
• Investigating the discrepancy property of de Bruijn sequences
• A number theoretic view on binary shift registers
• Novel way to research nonlinear feedback shift register
• Construction for de Bruijn sequences with large stage
• Test sequence construction using minimum information on the tested system
• Algorithms for the generation of full-length shift- register sequences
• Cryptographically Strong de Bruijn Sequences with Large Periods
• A new algorithm for the generation of binary de Bruijn sequences
• An efficient algorithm for generation of de Bruijn sequences over the ring \(F_2+uF_2\) by raising stage
• An algorithm for constructing m-ary de Bruijn sequences
• scientific article; zbMATH DE number 4045636 (Why is no real title available?)
• scientific article; zbMATH DE number 4081462 (Why is no real title available?)
• scientific article; zbMATH DE number 4106841 (Why is no real title available?)
• scientific article; zbMATH DE number 500267 (Why is no real title available?)
• An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
• The adjacency graphs of some feedback shift registers
• A BWT-based algorithm for random de Bruijn sequence construction
• Cut-down de Bruijn sequences
• New successor rules to efficiently produce exponentially many binary de Bruijn sequences
• Possible values for the nonlinearity of de Bruijn feedback functions
• Efficient construction of long orientable sequences
• Constructing k-ary orientable sequences with asymptotically optimal length
• Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences

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

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