Improved results on periodic multisequences with large error linear complexity
From MaRDI portal
Publication:609363
DOI10.1016/j.ffa.2010.09.002zbMath1205.94070OpenAlexW2092866472MaRDI QIDQ609363
Harald Niederreiter, Ayineedi Venkateswarlu
Publication date: 30 November 2010
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2010.09.002
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)
Related Items (2)
Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) ⋮ FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- The asymptotic behavior of the joint linear complexity profile of multisequences
- Error linear complexity measures for multisequences
- Periodic multisequences with large error linear complexity
- The stability theory of stream ciphers
- The expected value of the joint linear complexity of periodic multisequences
- Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Periodic sequences with large k-error linear complexity
- New Results on Periodic Sequences With Large $k$-Error Linear Complexity
- Cryptography and Coding
- Progress in Cryptology - INDOCRYPT 2003
- Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
- Algebraic Codes for Data Transmission
This page was built for publication: Improved results on periodic multisequences with large error linear complexity
