Repairing Reed-Solomon Codes
From MaRDI portal
Publication:4589401
Recommendations
- Repairing Reed-solomon codes
- Repairing Reed-Solomon Codes With Multiple Erasures
- Nonlinear Repair of Reed-Solomon Codes
- Repairing Reed-Solomon Codes via Subspace Polynomials
- Reed-Solomon codes
- Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes
- On Reed-Solomon codes
- Reed-solomon codes for correcting phased error bursts
- scientific article; zbMATH DE number 1026591
- Decoding of Reed Solomon codes beyond the error-correction bound
Cited in
(17)- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Improved single-round secure multiplication using regenerating codes
- Nonlinear Repair of Reed-Solomon Codes
- New bounds on the local leakage resilience of Shamir's secret sharing scheme
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
- A lower bound on the share size of leakage-resilient secret-sharing schemes
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
- Repairing Reed-solomon codes
- Leakage Resilient Cheating Detectable Secret Sharing Schemes
- Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction
- Codes for Distributed Storage
- On the local leakage resilience of linear secret sharing schemes
- Hierarchical erasure correction of linear codes
- Self-repairing codes
- Repairing Reed-Solomon Codes via Subspace Polynomials
- Constructing leakage-resilient Shamir's secret sharing: over composite order fields
- Constructing locally leakage-resilient linear secret-sharing schemes
This page was built for publication: Repairing Reed-Solomon Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589401)