scientific article; zbMATH DE number 1306883
From MaRDI portal
Publication:4252735
Cited in
(15)- Asymptotically optimal erasure-resilient codes for large disk arrays.
- On encoding symbol degrees of array BP-XOR codes
- Relaxed locally correctable codes
- Low-density parity-check codes achieve list-decoding capacity
- Erasures vs. errors in local decoding and property testing
- Local list recovery of high-rate tensor codes and applications
- scientific article; zbMATH DE number 7650135 (Why is no real title available?)
- Matrix structure and loss-resilient encoding/decoding
- Erasures versus errors in local decoding and property testing
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- Nearly optimal pseudorandomness from hardness
- Linear prover IOPs in log star rounds
- Good locally testable codes
- Failed disk recovery in double erasure RAID arrays
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252735)
