The following pages link to Repairing Reed-solomon codes (Q5361831):
Displaying 16 items.
- Universal secure rank-metric coding schemes with optimal communication overheads (Q1733972) (← links)
- Lower bounds for leakage-resilient secret sharing (Q2055623) (← links)
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages (Q2056737) (← links)
- Adaptive extractors and their application to leakage resilient secret sharing (Q2129011) (← links)
- Constructing locally leakage-resilient linear secret-sharing schemes (Q2129019) (← links)
- Self-repairing codes (Q2340045) (← links)
- Noisy interpolating sets for low-degree polynomials (Q3002826) (← links)
- Repairing Reed-Solomon Codes (Q4589401) (← links)
- Repairing Reed-Solomon Codes via Subspace Polynomials (Q5032504) (← links)
- Nonlinear Repair of Reed-Solomon Codes (Q5096980) (← links)
- Short leakage resilient and non-malleable secret sharing schemes (Q6097261) (← links)
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family (Q6114238) (← links)
- Stronger lower bounds for leakage-resilient secret sharing (Q6619933) (← links)
- Constructing leakage-resilient Shamir's secret sharing: over composite order fields (Q6637528) (← links)
- Protecting distributed primitives against leakage: equivocal secret sharing and more (Q6639504) (← links)
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing (Q6652971) (← links)