The asymptotic normalized linear complexity of multisequences
From MaRDI portal
Publication:933420
DOI10.1016/j.jco.2007.11.003zbMath1165.11063arXiv0705.4138OpenAlexW2091745612MaRDI QIDQ933420
Michael Vielhaber, Mónica del Pilar Canales Chacón
Publication date: 21 July 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.4138
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Irregularities of distribution, discrepancy (11K38)
Related Items
Improved results on the probabilistic theory of the joint linear complexity of multisequences, Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences
Cites Work
- The asymptotic behavior of the joint linear complexity profile of multisequences
- Enumeration results on the joint linear complexity of multisequences
- Multi-Continued Fraction Algorithms and Their Applications to Sequences
- Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
- A Unified View on Sequence Complexity Measures as Isometries
- Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F 2
- Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences