Stretching de Bruijn sequences
DOI10.1007/S10623-016-0314-4zbMATH Open1371.05159OpenAlexW2558573753MaRDI QIDQ2407718FDOQ2407718
Authors: Abbas M. Alhakim, Maher Nouiehed 
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
Recommendations
de Bruijn sequencelinear feedback shift registerrecursive constructionde Bruijn graph homomorphismLempel's D-morphism
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) General topics of discrete mathematics in relation to computer science (68R01) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
- On the cycle structure of some nonlinear shift register sequences
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- A recursive construction of nonbinary de Bruijn sequences
- Cryptographically Strong de Bruijn Sequences with Large Periods
Cited In (6)
- A recursive construction of nonbinary de Bruijn sequences
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
- On extending de Bruijn sequences
- On the \(k\)-error linear complexities of De Bruijn sequences
- A new upper bound on the order of affine sub-families of NFSRs
- A relation between sequences generated by Golomb's preference algorithm
Uses Software
This page was built for publication: Stretching de Bruijn sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407718)
