Pages that link to "Item:Q2516785"
From MaRDI portal
The following pages link to Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785):
Displaying 9 items.
- Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
- On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- List decoding of number field codes (Q2249795) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
