Periodic multisequences with large error linear complexity
From MaRDI portal
Publication:1009057
DOI10.1007/s10623-008-9174-xzbMath1179.94056MaRDI QIDQ1009057
Harald Niederreiter, Ayineedi Venkateswarlu
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9174-x
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
11B50: Sequences (mod (m))
Related Items
Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\), The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence, Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields, FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\), Improved results on periodic multisequences with large error linear complexity, The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
Cites Work
- Extension of the Berlekamp-Massey algorithm to N dimensions
- The asymptotic behavior of the joint linear complexity profile of multisequences
- Error linear complexity measures for multisequences
- Enumeration results on the joint linear complexity of multisequences
- 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
- The expectation and variance of the joint linear complexity of random periodic multisequences
- The Probabilistic Theory of the Joint Linear Complexity of Multisequences
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Periodic sequences with large k-error linear complexity
- Cryptography and Coding
- Progress in Cryptology - INDOCRYPT 2003
- Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
- Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item