Pages that link to "Item:Q4552984"

The following pages link to Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders (Q4552984):

Displaying 3 items.

• The generalized Goertzel algorithm and its parallel hardware implementation (Q2481284) (← links)
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
• Finding BCH error locator polynomials in one step (Q3363243) (← links)