On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
From MaRDI portal
Publication:539903
DOI10.1016/j.ffa.2011.01.001zbMath1225.94013MaRDI QIDQ539903
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
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
93B20: Minimal systems representations
93B15: Realizations from input-output data
15A54: Matrices over function rings in one or more variables
Related Items
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