The minimal polynomial over F_q of linear recurring sequence over F_q^m

DOI10.1016/J.FFA.2009.07.002zbMATH Open1228.11173OpenAlexW2964350992MaRDI QIDQ1046471FDOQ1046471

Authors: Zhihan Gao, Fangwei Fu 

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

Recommendations

• Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences
• On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
• On the minimal polynomial of the product of linear recurring sequences
• scientific article; zbMATH DE number 39524
• A remark on the minimal polynomial of the product of linear recurring sequences

zbMATH Keywords

minimal polynomiallinear complexitylinear recurring sequencesmultisequencesjoint linear complexityjoint minimal polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Recurrences (11B37)

Cites Work

• The expectation and variance of the joint linear complexity of random periodic multisequences
• Title not available (Why is that?)
• Joint linear complexity of multisequences consisting of linear recurring sequences
• Analysis and design of stream ciphers
• The stability theory of stream ciphers
• Title not available (Why is that?)
• Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences
• Title not available (Why is that?)
• Periodic multisequences with large error linear complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Progress in Cryptology - INDOCRYPT 2003
• On the joint linear complexity profile of explicit inversive multisequences
• Multisequences with almost perfect linear complexity profile and function fields over finite fields
• Error linear complexity measures for multisequences
• Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
• The expected value of the joint linear complexity of periodic multisequences
• Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences
• Generating linear spans over finite fields
• Generalized Joint Linear Complexity of Linear Recurring Multisequences
• Values of linear recurring sequences of vectors over finite fields
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
• The Probabilistic Theory of the Joint Linear Complexity of Multisequences
• Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
• Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
• The asymptotic behavior of the joint linear complexity profile of multisequences
• Enumeration results on the joint linear complexity of multisequences
• Multi-sequences with \(d\)-perfect property
• Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences

Cited In (6)

• Linear recurring sequences and subfield subcodes of cyclic codes
• Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences
• The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
• On the minimal polynomial of the product of linear recurring sequences
• Composed products and factors of cyclotomic polynomials over finite fields
• On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)

This page was built for publication: The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046471)