The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
From MaRDI portal
Publication:1046471
DOI10.1016/j.ffa.2009.07.002zbMath1228.11173OpenAlexW2964350992MaRDI QIDQ1046471
Publication date: 22 December 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.07.002
linear recurring sequencesminimal polynomiallinear complexitymultisequencesjoint linear complexityjoint minimal polynomial
Related Items
Composed products and factors of cyclotomic polynomials over finite fields, The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence, Linear recurring sequences and subfield subcodes of cyclic codes, On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the joint linear complexity profile of explicit inversive multisequences
- Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences
- 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
- Periodic multisequences with large error linear complexity
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Analysis and design of stream ciphers
- The stability theory of stream ciphers
- The expected value of the joint linear complexity of periodic multisequences
- Multi-sequences with \(d\)-perfect property
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences
- The expectation and variance of the joint linear complexity of random periodic multisequences
- Generating linear spans over finite fields
- The Probabilistic Theory of the Joint Linear Complexity of Multisequences
- Generalized Joint Linear Complexity of Linear Recurring Multisequences
- Values of linear recurring sequences of vectors over finite fields
- Progress in Cryptology - INDOCRYPT 2003
- Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
- 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
- Multisequences with almost perfect linear complexity profile and function fields over finite fields
