A linear time erasure-resilient code with nearly optimal recovery
From MaRDI portal
(Redirected from Publication:3129459)
Recommendations
Cited in
(16)- Scalable secure storage when half the system is faulty
- Erasure-resilient codes from affine spaces
- Compact proofs of retrievability
- Zigzag decodable codes: linear-time erasure codes with applications to data storage
- Exact emulation of a priority queue with a switch and delay lines
- Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding
- scientific article; zbMATH DE number 1504652 (Why is no real title available?)
- scientific article; zbMATH DE number 1559530 (Why is no real title available?)
- Efficient erasure correcting codes
- Local list recovery of high-rate tensor codes and applications
- Relaxed locally correctable codes
- scientific article; zbMATH DE number 7650135 (Why is no real title available?)
- Codes on graphs: Recent progress
- Matrix structure and loss-resilient encoding/decoding
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Two classes of LDPC codes from the space of Hermitian matrices over finite fields
This page was built for publication: A linear time erasure-resilient code with nearly optimal recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129459)
