Linear complexity profiles and jump complexity

DOI10.1016/S0020-0190(97)00004-5zbMath1336.94032OpenAlexW2013034268MaRDI QIDQ290210

F. Blanchet-Sadri, M. Dambrine

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00004-5

zbMATH Keywords

cryptographypseudo-random sequenceslinear complexity

Mathematics Subject Classification ID

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

Related Items

Jump and hop randomness tests for binary sequences ⋮ On distribution properties of sequences with perfect linear complexity profile ⋮ Enumeration results on linear complexity profiles and lattice profiles

Cites Work

• Perfect staircase profile of linear complexity for finite sequences
• New binary sequences with perfect staircase profile of linear complexity
• Linear Complexity and Random Sequences
• Shift-register synthesis and BCH decoding

This page was built for publication: Linear complexity profiles and jump complexity