Pages that link to "Item:Q931140"

The following pages link to List decoding of Reed-Solomon codes from a Gröbner basis perspective (Q931140):

Displaying 12 items.

• List decoding of repeated codes (Q371249) (← links)
• Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes (Q507148) (← links)
• Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
• An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (Q522204) (← links)
• Efficient list decoding of a class of algebraic-geometry codes (Q540394) (← links)
• Minimal Gröbner bases and the predictable leading monomial property (Q609485) (← links)
• Generic interpolation polynomial for list decoding (Q661987) (← links)
• List decoding of Hermitian codes using Gröbner bases (Q733508) (← links)
• Key equations for list decoding of Reed-Solomon codes and how to solve them (Q975823) (← links)
• Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
• Computing minimal interpolation bases (Q2628323) (← links)