On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)

DOI10.1016/j.ffa.2011.01.001zbMath1225.94013OpenAlexW2199279588MaRDI QIDQ539903

Li-Ping Wang

Publication date: 31 May 2011

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2011.01.001

zbMATH Keywords

latticesBerlekamp-Massey algorithmmatrix sequencesmultisequencesminimal partial realization

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Minimal systems representations (93B20) Realizations from input-output data (93B15) Matrices over function rings in one or more variables (15A54)

Related Items (1)

New application methods for word-oriented cryptographic primitives

Cites Work

• Unnamed Item
• Unnamed Item
• The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
• Construction and estimation of bases in function fields
• Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm
• A Lattice-Based Minimal Partial Realization Algorithm
• On recursiveness and related topics in linear systems
• A minimal realization algorithm for matrix sequences
• Shift-register synthesis and BCH decoding

This page was built for publication: On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)