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

DOI10.1109/TIT.1984.1056919zbMath0546.68056MaRDI QIDQ3336716

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)

Related Items (24)

An algorithm for generating shift-register cycles ⋮ The adjacency graphs of FSRs with a class of affine characteristic functions ⋮ Construction for de Bruijn sequences with large stage ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Generation of full cycles by a composition of NLFSRs ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs ⋮ An interleaved method for constructing de Bruijn sequences ⋮ Nonsingular Polynomials from Feedback Shift Registers ⋮ A surprisingly simple de Bruijn sequence construction ⋮ The adjacency graphs of some feedback shift registers ⋮ Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR ⋮ 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 ⋮ A simple shift rule for \(k\)-ary de Bruijn sequences ⋮ Self-dual sequences ⋮ Constructing de Bruijn Sequences Based on a New Necessary Condition ⋮ Clues to the hidden nature of de Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences ⋮ Universal circuit matrix for adjacency graphs of feedback functions

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