Pages that link to "Item:Q1780828"
From MaRDI portal
The following pages link to List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition (Q1780828):
Displaying 15 items.
- Fusion systems and constructing free actions on products of spheres (Q415468) (← links)
- List decodability at small radii (Q717148) (← links)
- List decoding of Reed-Solomon codes from a Gröbner basis perspective (Q931140) (← links)
- Multiple packing in sum-type metric spaces (Q947090) (← links)
- Improvements on the Johnson bound for Reed-Solomon codes (Q1028479) (← links)
- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain (Q1033892) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- Traceability codes and their generalizations (Q2190905) (← links)
- List decoding of number field codes (Q2249795) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- Some properties of antistochastic strings (Q2411042) (← links)
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise (Q2968158) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Singleton-type bounds for list-decoding and list-recovery, and related results (Q6187335) (← links)
