Perfect staircase profile of linear complexity for finite sequences

DOI10.1016/0020-0190(92)90190-7MaRDI QIDQ1201870zbMATH OpenOpenAlexFDO

Authors 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

linear complexitypseudo-random sequencesrandomness

Mathematics Subject Classification ID

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

Recommendations

• On distribution properties of sequences with perfect linear complexity profile
• Sequences with almost perfect linear complexity profiles and curves over finite fields
• New binary sequences with perfect staircase profile of linear complexity
• Linear Complexity and Random Sequences
• A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences

Cites work

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

Cited in

(5)

• New binary sequences with perfect staircase profile of linear complexity
• Linear complexity profiles and jump complexity
• Return time complexity of Sturmian sequences
• On the limit of maximal density of sequences with a perfect linear complexity profile
• Sequences with controllable linear complexity profile

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201870)