The following pages link to S. V. Fedorenko (Q415655):
Displaying 14 items.
- A method for computation of the discrete Fourier transform over a finite field (Q415656) (← links)
- Decoding complexity of linear block codes (Q1337931) (← links)
- Generalized information-set decoding of \((L,g)\)-codes (Q1337936) (← links)
- On algebraic decoding of cyclic codes (Q1567726) (← links)
- Decoding by generalized information sets (Q1925355) (← links)
- A method for fast computation of the Fourier transform over a finite field (Q2487094) (← links)
- A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm (Q3546866) (← links)
- Correction to “A Simple Algorithm for Decoding Reed–Solomon Codes and Its Relation to the Welch–Berlekamp Algorithm” (Q3546867) (← links)
- (Q4500996) (← links)
- Normalized Cyclic Convolution: The Case of Even Length (Q4580844) (← links)
- Tables of coverings for decoding by S-sets (Q4637811) (← links)
- (Q4664668) (← links)
- (Q4664705) (← links)
- Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field (Q5103032) (← links)
