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

feedback; cycles; algorithms for the generation of de Bruijn sequences; full-length shift-register sequences

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68R99: Discrete mathematics in relation to computer science

Related Items

Constructing de Bruijn Sequences Based on a New Necessary Condition, On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs, Nonsingular Polynomials from Feedback Shift Registers, Generation of full cycles by a composition of NLFSRs, A surprisingly simple de Bruijn sequence construction, The adjacency graphs of some feedback shift registers, A simple shift rule for \(k\)-ary de Bruijn sequences, An algorithm for generating shift-register cycles, Universal circuit matrix for adjacency graphs of feedback functions, Clues to the hidden nature of de Bruijn sequences, The adjacency graphs of FSRs with a class of affine characteristic functions, Construction of de Bruijn sequences from product of two irreducible polynomials, An interleaved method for constructing de Bruijn sequences, A framework for constructing de Bruijn sequences via simple successor rules, Self-dual sequences, Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR, An efficiently generated family of binary de Bruijn sequences, Construction for de Bruijn sequences with large stage, On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials, Test sequence construction using minimum information on the tested system