Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences

DOI10.1016/j.ffa.2009.03.001zbMath1183.94015MaRDI QIDQ841240

Harald Niederreiter, Ferruh Özbudak, Fang-Wei Fu

Publication date: 15 September 2009

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2009.03.001

zbMATH Keywords

linear recurring sequences; variance; expectation; joint linear complexity; random multisequences

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

94A60: Cryptography

11B37: Recurrences

Related Items

Spectra of a class of quadratic functions: average behaviour and counting functions, The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\), Multidimensional linear complexity analysis of periodic arrays

Cites Work

• The asymptotic behavior of the joint linear complexity profile of multisequences
• Enumeration results on the joint linear complexity of multisequences
• The expected value of the joint linear complexity of periodic multisequences
• The expectation and variance of the joint linear complexity of random periodic multisequences
• On the Joint Linear Complexity of Linear Recurring Multisequences
• Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences