The following pages link to Nicolas Resch (Q2236660):
Displaying 17 items.
- Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
- Low-Density Parity-Check Codes Achieve List-Decoding Capacity (Q5020732) (← links)
- Threshold Rates for Properties of Random Codes (Q5030333) (← links)
- Bounds for List-Decoding and List-Recovery of Random Linear Codes (Q5030334) (← links)
- (Q5121892) (← links)
- On List Recovery of High-Rate Tensor Codes (Q5151710) (← links)
- (Q5875528) (← links)
- (Q6084352) (← links)
- Sharp threshold rates for random codes (Q6348784) (← links)
- Interactive coding with small memory (Q6538670) (← links)
- Threshold rates of code ensembles: linear is best (Q6560903) (← links)
- Smoothing codes and lattices: systematic study and new bounds (Q6574864) (← links)
- Threshold rates of code ensembles: linear is best (Q6576647) (← links)
- Generalized special-sound interactive proofs and their knowledge soundness (Q6582226) (← links)
- Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery (Q6638105) (← links)
- Two-round perfectly secure message transmission with optimal transmission rate (Q6642384) (← links)
- Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery (Q6670124) (← links)
