Pages that link to "Item:Q4887053"
From MaRDI portal
The following pages link to Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes (Q4887053):
Displaying 12 items.
- Multitrial decoding of concatenated codes using fixed thresholds (Q415715) (← links)
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes (Q1675777) (← links)
- On multi-trial Forney-Kovalev decoding of concatenated codes (Q2437957) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- Generalized minimum-distance decoding of Euclidean-space codes and lattices (Q3129484) (← links)
- Generalized minimum distance decoding algorithms for Qary output channels (Corresp.) (Q3869251) (← links)
- (Q4349319) (← links)
- (Q4474252) (← links)
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance (Q4503508) (← links)
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes (Q4701109) (← links)
- Minimum Distance Decoding of General Algebraic Geometry Codes via Lists (Q5281294) (← links)