Cryptographically Strong de Bruijn Sequences with Large Periods
From MaRDI portal
Recommendations
- De Bruijn sequences with efficient decoding algorithms
- ``Periods of de Bruijn sequences
- scientific article; zbMATH DE number 1676648
- Construction for de Bruijn sequences with large stage
- De Bruijn sequences, irreducible codes and cyclotomy
- Notes on de Bruijn sequences
- De Bruijn sequences for fixed-weight binary strings
- A method for constructing decodable de Bruijn sequences
- Extending de Bruijn sequences to larger alphabets
Cites work
- A class of nonlinear de Bruijn cycles
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- An efficient algorithm for the generation of DeBruijn cycles
- Characterizations of generators for modified de Bruijn sequences
- Construction of de Bruijn sequences of minimal complexity
- Cryptographic properties of the Welch-Gong transformation sequence generators
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
- On the complexities of de-Bruijn sequences
- On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions
- On the cycle structure of some nonlinear shift register sequences
- On the quadratic spans of DeBruijn sequences
- Randomness and Representation of Span n Sequences
Cited in
(14)- Clues to the hidden nature of de Bruijn sequences
- On ideal t-tuple distribution of filtering de Bruijn sequence generators
- An interleaved method for constructing de Bruijn sequences
- 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
- On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators
- Construction for de Bruijn sequences with large stage
- Stretching de Bruijn sequences
- A relation between sequences generated by Golomb's preference algorithm
- On cross joining de Bruijn sequences
- Constructing de Bruijn sequences based on a new necessary condition
- scientific article; zbMATH DE number 4195881 (Why is no real title available?)
- A BWT-based algorithm for random de Bruijn sequence construction
- Near-optimal covering sequences
This page was built for publication: Cryptographically Strong de Bruijn Sequences with Large Periods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455491)