Pages that link to "Item:Q3772131"
From MaRDI portal
The following pages link to On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.) (Q3772131):
Displaying 14 items.
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field (Q1026985) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain (Q1894579) (← links)
- Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\) (Q2130054) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials (Q2473633) (← links)
- The Berlekamp-Massey algorithm revisited (Q2502174) (← links)
- Block diagonalization and LU-equivalence of Hankel matrices (Q2576218) (← links)
- Euclid’s algorithm and the Lanczos method over finite fields (Q4210963) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
- ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS (Q5089874) (← links)
- A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes (Q6566686) (← links)
