Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
The Berlekamp–Massey algorithm over finite rings, modules, and bimodules
-
V. L. KURAKIN
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1998
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- The Berlekamp–Massey algorithm over finite rings, modules, and bimodules
- Finiteness of the set of automaton Post bases with solvable completeness problem
- A polynomial algorithm for the recognition of belonging a function of k-valued logic realized by a polynomial to precomplete classes of self-dual functions
- The shrinking-and-expanding method for the graph enumeration
- The independence function and generalized Ramsey numbers
- Discrete optimal filtering
- On asymptotic expansions of Stirling numbers of the first and second kinds
Artikel in diesem Heft
- The Berlekamp–Massey algorithm over finite rings, modules, and bimodules
- Finiteness of the set of automaton Post bases with solvable completeness problem
- A polynomial algorithm for the recognition of belonging a function of k-valued logic realized by a polynomial to precomplete classes of self-dual functions
- The shrinking-and-expanding method for the graph enumeration
- The independence function and generalized Ramsey numbers
- Discrete optimal filtering
- On asymptotic expansions of Stirling numbers of the first and second kinds
