Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences

DOI10.1016/j.ffa.2008.09.004zbMath1210.94085OpenAlexW2001610503MaRDI QIDQ2517819

Wilfried Meidl, Ferruh Özbudak

Publication date: 9 January 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.2008.09.004

zbMATH Keywords

linear recurring sequencesmultisequencesjoint linear complexitygeneralized joint linear complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (3)

The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence ⋮ On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\) ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)

Cites Work

• Generalized Joint Linear Complexity of Linear Recurring Multisequences
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences