Algorithms for the generation of full-length shift- register sequences

DOI10.1109/TIT.1984.1056919MaRDI QIDQ3336716zbMATH OpenFDO

Authors Tuvi Etzion, Abraham Lempel

Publication date 1984

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

zbMATH Keywords

feedbackcyclesalgorithms for the generation of de Bruijn sequencesfull-length shift-register sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 123794
• An efficient algorithm for the generation of DeBruijn cycles
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A new algorithm for the generation of binary de Bruijn sequences
• Notes on de Bruijn sequences

Cited in

(43)

• Algorithms for the exact solution of the problems of enumeration, coding, and generation of serial sequences
• Notes on de Bruijn sequences
• Algorithm for the generation of nonlinear de Bruijn sequences
• Generation of full cycles by a composition of NLFSRs
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Construction for de Bruijn sequences with large stage
• Graphs with the unique path property: Structure, cycles, factors, and constructions
• Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
• On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
• On greedy algorithms for binary de Bruijn sequences
• scientific article; zbMATH DE number 4081462 (Why is no real title available?)
• An efficiently generated family of binary de Bruijn sequences
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• Constructing the first (and coolest) fixed-content universal cycle
• A simple shift rule for \(k\)-ary de Bruijn sequences
• An efficient algorithm for generation of de Bruijn sequences over the ring \(F_2+uF_2\) by raising stage
• Nonsingular polynomials from feedback shift registers
• The adjacency graphs of FSRs with a class of affine characteristic functions
• An efficient algorithm for the generation of DeBruijn cycles
• Universal circuit matrix for adjacency graphs of feedback functions
• An algorithm for constructing m-ary de Bruijn sequences
• scientific article; zbMATH DE number 844162 (Why is no real title available?)
• Clues to the hidden nature of de Bruijn sequences
• Test sequence construction using minimum information on the tested system
• Constructing de Bruijn sequences based on a new necessary condition
• A recursive algorithm for generating \(k\)-ary de Bruijn sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Properties of the cycles that contain all vectors of weight \(\le k\)
• scientific article; zbMATH DE number 4045633 (Why is no real title available?)
• scientific article; zbMATH DE number 220144 (Why is no real title available?)
• Generalized cycle joining method and its application to the construction of long-period Galois NFSRs
• Algebraic Shift Register Sequences
• A surprisingly simple de Bruijn sequence construction
• Self-dual sequences
• Shift Register Sequences – A Retrospective Account
• The adjacency graphs of some feedback shift registers
• Construction of de Bruijn sequences from product of two irreducible polynomials
• Shift Register Sequences
• scientific article; zbMATH DE number 3919846 (Why is no real title available?)
• A framework for constructing de Bruijn sequences via simple successor rules
• Applying a generalized allocation scheme to analyzing a class of sequences generated by a shift register
• An algorithm for generating shift-register cycles
• An interleaved method for constructing de Bruijn sequences

This page was built for publication: Algorithms for the generation of full-length shift- register sequences

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