The expected value of the joint linear complexity of periodic multisequences
From MaRDI portal
Publication:1394937
DOI10.1016/S0885-064X(02)00009-2zbMath1026.68067OpenAlexW2107478620MaRDI QIDQ1394937
Harald Niederreiter, Wilfried Meidl
Publication date: 25 June 2003
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0885-064x(02)00009-2
Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)
Related Items
Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences ⋮ On the joint 2-adic complexity of binary multisequences ⋮ The asymptotic behavior of the joint linear complexity profile of multisequences ⋮ Improved results on periodic multisequences with large error linear complexity ⋮ Error linear complexity measures for multisequences ⋮ The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence ⋮ Analysis and computation of multidimensional linear complexity of periodic arrays ⋮ Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields ⋮ An algorithm fork-error joint linear complexity of binary multisequences ⋮ On the counting function of the lattice profile of periodic sequences ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ Expected π-Adic Security Measures of Sequences ⋮ Generalized Joint Linear Complexity of Linear Recurring Multisequences ⋮ Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm ⋮ Periodic multisequences with large error linear complexity ⋮ Multidimensional linear complexity analysis of periodic arrays ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ Lower bounds on error complexity measures for periodic LFSR and FCSR sequences ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension of the Berlekamp-Massey algorithm to N dimensions
- The stability theory of stream ciphers
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Linear Complexity of Periodic Sequences: A General Theory
- Linear Complexity and Random Sequences
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Multisequences with almost perfect linear complexity profile and function fields over finite fields
