Pages that link to "Item:Q540394"
From MaRDI portal
The following pages link to Efficient list decoding of a class of algebraic-geometry codes (Q540394):
Displaying 10 items.
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources (Q326306) (← links)
- Generalization of the Lee-O'Sullivan list decoding for one-point AG codes (Q390381) (← 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)
- Generic interpolation polynomial for list decoding (Q661987) (← links)
- Improved power decoding of interleaved one-point Hermitian codes (Q1727371) (← links)
- Weighted Reed-Muller codes revisited (Q1934223) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Bounds on the List-Decoding Radius of Reed--Solomon Codes (Q4443130) (← links)
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets (Q5429508) (← links)