The following pages link to (Q4474234):
Displaying 13 items.
- Efficient list decoding of a class of algebraic-geometry codes (Q540394) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Algorithms for \(q\)-ary error-correcting codes with limited magnitude and feedback (Q2214047) (← links)
- List decoding of number field codes (Q2249795) (← 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)
- Improved decoding of Reed-Solomon and algebraic-geometry codes (Q4503371) (← links)
- (Q4534643) (← links)
- List decoding: Algorithms and applications (Q4536409) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)
- List decoding of maximal order codes over number fields (Q6185629) (← links)