Perfect staircase profile of linear complexity for finite sequences

DOI10.1016/0020-0190(92)90190-7zbMath0772.68033OpenAlexW2005372356MaRDI QIDQ1201870

Masakatu Morii, Masao Kasahara

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90190-7

zbMATH Keywords

pseudo-random sequenceslinear complexityrandomness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Linear complexity profiles and jump complexity ⋮ New binary sequences with perfect staircase profile of linear complexity

Cites Work

• Proof of Rueppel's linear complexity conjecture (Corresp.)
• Linear Complexity and Random Sequences
• Shift-register synthesis and BCH decoding

This page was built for publication: Perfect staircase profile of linear complexity for finite sequences