Linear Complexity of Periodically Repeated Random Sequences

DOI10.1007/3-540-46416-6_15zbMATH Open0766.94003OpenAlexW2169281735MaRDI QIDQ4037463FDOQ4037463

Authors: Zongduo Dai, Junhui Yang 

Publication date: 18 May 1993

Published in: Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-46416-6_15

Recommendations

• Centralizers and iterate radicals of morse-smale diffeomorphisms of the circle
• Linear Complexity and Random Sequences
• scientific article; zbMATH DE number 26870
• On the calculation of the linear complexity of periodic sequences
• Linear complexity of periodic sequences: a general theory
• Progress in Cryptology - INDOCRYPT 2003
• A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
• The complexity of stochastic sequences
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• The expectation and variance of the joint linear complexity of random periodic multisequences

zbMATH Keywords

linear complexityperiodically repeated random bit sequence

Mathematics Subject Classification ID

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

Cited In (7)

• Linear Complexity and Random Sequences
• Proof of Rueppel's linear complexity conjecture (Corresp.)
• Title not available (Why is that?)
• The expectation and variance of the joint linear complexity of random periodic multisequences
• How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences
• Revisiting the relationship between compositional sequence complexity and periodicity
• On the counting function of the lattice profile of periodic sequences

This page was built for publication: Linear Complexity of Periodically Repeated Random Sequences

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