Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
From MaRDI portal
Publication:5450818
DOI10.1007/11423461_5zbMath1145.94447OpenAlexW1496078260MaRDI QIDQ5450818
Publication date: 14 March 2008
Published in: Sequences and Their Applications - SETA 2004 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11423461_5
Related Items (7)
The asymptotic behavior of the joint linear complexity profile of multisequences ⋮ The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence ⋮ Generalized Joint Linear Complexity of Linear Recurring Multisequences ⋮ Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences ⋮ Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
This page was built for publication: Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
