|
Problemy Peredachi Informatsii, 1999, Volume 35, Issue 2, Pages 38–50
(Mi ppi441)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Coding Theory
The Berlekamp–Massey Algorithm over a Finite Commutative Ring
V. L. Kurakin
Abstract:
An algorithm for finding a monic polynomial of the least degree that generates a given sequence of length $\ell$ over a finite commutative ring $R$ with identity is presented. The complexity of the algorithm is $O(\ell_2)$ operations in $R$ as $\ell\to\infty$.
Received: 20.04.1998
Citation:
V. L. Kurakin, “The Berlekamp–Massey Algorithm over a Finite Commutative Ring”, Probl. Peredachi Inf., 35:2 (1999), 38–50; Problems Inform. Transmission, 35:2 (1999), 125–135
Linking options:
https://www.mathnet.ru/eng/ppi441 https://www.mathnet.ru/eng/ppi/v35/i2/p38
|
|