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

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)

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

(32)

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