Pages that link to "Item:Q1361883"
From MaRDI portal
The following pages link to Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883):
Displaying 12 items.
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory (Q6123057) (← links)
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head'' (Q6132422) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
- On the error-correcting pair for MDS linear codes with even minimum distance (Q6156924) (← links)
- List decoding of maximal order codes over number fields (Q6185629) (← links)
- Collision Resistance from Multi-collision Resistance (Q6489330) (← links)
- Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Factoring polynomials over function fields (Q6653359) (← links)