Stretching de Bruijn sequences

DOI10.1007/s10623-016-0314-4zbMath1371.05159OpenAlexW2558573753MaRDI QIDQ2407718

Maher Nouiehed, Abbas Alhakim

Publication date: 6 October 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0314-4

zbMATH Keywords

recursive constructionde Bruijn sequencelinear feedback shift registerde Bruijn graph homomorphismLempel's D-morphism

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

A new upper bound on the order of affine sub-families of NFSRs ⋮ A relation between sequences generated by Golomb's preference algorithm ⋮ Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR ⋮ On the \(k\)-error linear complexities of De Bruijn sequences

Uses Software

• eSTREAM
• Grain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A recursive construction of nonbinary de Bruijn sequences
• Cryptographically Strong de Bruijn Sequences with Large Periods
• On the cycle structure of some nonlinear shift register sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

This page was built for publication: Stretching de Bruijn sequences