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