Generalized Joint Linear Complexity of Linear Recurring Multisequences

DOI10.1007/978-3-540-85912-3_24zbMath1206.94040OpenAlexW1567112427MaRDI QIDQ3600447

Ferruh Özbudak, Wilfried Meidl

Publication date: 10 February 2009

Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85912-3_24

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items

The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence ⋮ Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Joint linear complexity of multisequences consisting of linear recurring sequences
• Analysis and design of stream ciphers
• Advances in cryptology - EUROCRYPT '91. Workshop on the theory and application of cryptographic techniques, Brighton, GB, April 8-11, 1991. Proceedings
• The expected value of the joint linear complexity of periodic multisequences
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• The expectation and variance of the joint linear complexity of random periodic multisequences
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
• Shift-register synthesis and BCH decoding

This page was built for publication: Generalized Joint Linear Complexity of Linear Recurring Multisequences