On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

DOI10.1109/T-C.1970.222859zbMath0225.94028OpenAlexW2059514976MaRDI QIDQ5632465

Abraham Lempel

Publication date: 1970

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

Full work available at URL: https://doi.org/10.1109/t-c.1970.222859

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items

Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers, Perfect factors in the de Bruijn graph, Cryptographically Strong de Bruijn Sequences with Large Periods, On the connectivity of the De Bruijn graph, New classes of perfect maps. I, The adjacency graphs of FSRs with a class of affine characteristic functions, The combinatorics of binary arrays, The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields, Construction for de Bruijn sequences with large stage, Stretching de Bruijn sequences, Mapping prefer-opposite to prefer-one de Bruijn sequences, Uniform homomorphisms of de Bruijn and Kautz networks, A relation between sequences generated by Golomb's preference algorithm, Generation of some de Bruijn sequences, Graphs with the unique path property: Structure, cycles, factors, and constructions, On extending de Bruijn sequences, On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs, Unnamed Item, On semi-perfect de Bruijn words, Computations of (alpha,k)-machines, An interleaved method for constructing de Bruijn sequences, A particular Hamiltonian cycle on middle levels in the De Bruijn digraph, The adjacency graphs of some feedback shift registers, Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs, Particular cycles of a binary de Bruijn digraph, Rotating-table games and derivatives of words, A recursive construction of nonbinary de Bruijn sequences, Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR, On the parity of the frequency of cycle lengths of shift register sequences, A class of nonlinear de Bruijn cycles, Cycle decomposition by disjoint transpositions, Test sequence construction using minimum information on the tested system, On some classes of nonlinear shift registers with the same cyclic structure, Approximate Moore graphs are good expanders, On the structure property of PCR's adjacency graph with a prime order and its application of constructing M-sequences, On the \(k\)-error linear complexities of De Bruijn sequences, Self-dual sequences, A multiple stream generator based on de Bruijn digraph homomorphisms, On stability of multi-valued nonlinear feedback shift registers, On the complexities of de-Bruijn sequences, Storage efficient decoding for a class of binary de Bruijn sequences, A number theoretic view on binary shift registers, The enumeration of shift register sequences, There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\), On the distribution of de Bruijn sequences of low complexity