Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
From MaRDI portal
(Redirected from Publication:3546748)
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Recommendations
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
- Asymptotic analysis on the normalized k-error linear complexity of binary sequences
- The asymptotic normalized linear complexity of multisequences
- Analysis of the linear complexity and its stability for periodic binary sequences
- scientific article; zbMATH DE number 5150220
- Linear complexity of periodic sequences: a general theory
- On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes
- scientific article; zbMATH DE number 26870
- On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
Cited in
(6)- The asymptotic behavior of \(N\)-adic complexity
- The Asymptotic Behavior of π-Adic Complexity with π2 = − 2
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
- Asymptotic analysis on the normalized k-error linear complexity of binary sequences
- On the limit of maximal density of sequences with a perfect linear complexity profile
- The asymptotic normalized linear complexity of multisequences
This page was built for publication: Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546748)
