Randomness and Representation of Span n Sequences

DOI10.1007/978-3-540-77404-4_19zbMath1154.94356OpenAlexW1578165310MaRDI QIDQ5448574

Guang Gong

Publication date: 7 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77404-4_19

zbMATH Keywords

discrete Fourier transformde Bruijn sequencesrandomnessNonlinear feedback shift register sequencesspan \(n\) sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (2)

Cryptographically Strong de Bruijn Sequences with Large Periods ⋮ Preliminary results on the minimal polynomial of modified de Bruijn sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• On the complexities of de-Bruijn sequences
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Communication Theory of Secrecy Systems*
• Construction of de Bruijn sequences of minimal complexity
• On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
• Linear spans of modified de Bruijn sequences
• Foundations of Cryptography
• Advances in Cryptology - CRYPTO 2003
• Shift-register synthesis and BCH decoding

This page was built for publication: Randomness and Representation of Span n Sequences