Characterizations of generators for modified de Bruijn sequences
From MaRDI portal
Publication:1802351
DOI10.1016/0196-8858(92)90021-NzbMath0787.11049MaRDI QIDQ1802351
Solomon W. Golomb, Gregory L. Mayhew
Publication date: 25 May 1994
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
Cryptographically Strong de Bruijn Sequences with Large Periods, The analysis of de Bruijn sequences of non-extremal weight
Cites Work
- On ``bent functions
- Clues to the hidden nature of de Bruijn sequences
- On the complexities of de-Bruijn sequences
- On the distribution of de Bruijn sequences of given complexity
- On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- On primitive trinomials (Mod 2)
- The Lattice Point Covering Theorem for Rectangles
- Unnamed Item
- Unnamed Item
- Unnamed Item