Pages that link to "Item:Q3546485"
From MaRDI portal
The following pages link to Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes (Q3546485):
Displaying 16 items.
- List decoding of repeated codes (Q371249) (← links)
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
- Interpolation in list decoding of Reed-Solomon codes (Q927473) (← links)
- List decoding of Reed-Solomon codes from a Gröbner basis perspective (Q931140) (← links)
- Key equations for list decoding of Reed-Solomon codes and how to solve them (Q975823) (← links)
- Decoding interleaved Gabidulin codes using Alekhnovich's algorithm (Q1743304) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes (Q2070293) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm (Q3540917) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
