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

DOI10.1109/TIT.1984.1056919zbMATH Open0546.68056MaRDI QIDQ3336716FDOQ3336716

Tuvi Etzion, Abraham Lempel

Publication date: 1984

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

Recommendations

• scientific article
• 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

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)

Cited In (42)

• 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
• Nonsingular Polynomials from Feedback Shift Registers
• Constructing de Bruijn Sequences Based on a New Necessary Condition
• On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
• Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
• On greedy algorithms for binary de Bruijn sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficiently generated family of binary de Bruijn sequences
• Constructing the first (and coolest) fixed-content universal cycle
• A simple shift rule for \(k\)-ary de Bruijn sequences
• The adjacency graphs of FSRs with a class of affine characteristic functions
• An efficient algorithm for the generation of DeBruijn cycles
• An algorithm for constructing m-ary de Bruijn sequences
• Universal circuit matrix for adjacency graphs of feedback functions
• Title not available (Why is that?)
• Test sequence construction using minimum information on the tested system
• Clues to the hidden nature of de Bruijn sequences
• 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\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Applying a generalized allocation scheme to analyzing a class of sequences generated by a shift register
• A framework for constructing de Bruijn sequences via simple successor rules
• 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)