Pages that link to "Item:Q2502174"
From MaRDI portal
The following pages link to The Berlekamp-Massey algorithm revisited (Q2502174):
Displaying 15 items.
- A generalization of the Massey-Ding algorithm (Q1389143) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- An interpolation algorithm for computing Dixon resultants (Q2109984) (← links)
- On Berlekamp-Massey and Berlekamp-Massey-Sakata algorithms (Q2175591) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- Galois theory, splitting fields and computer algebra (Q2457393) (← links)
- Block diagonalization and LU-equivalence of Hankel matrices (Q2576218) (← links)
- A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.) (Q3026910) (← links)
- The BMS Algorithm (Q3652816) (← links)
- (Q4857240) (← links)
- ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS (Q5089874) (← links)
- Computational Science - ICCS 2004 (Q5712666) (← links)
- The Berlekamp-Massey Algorithm revisited (Q6418021) (← links)