Pages that link to "Item:Q3129459"
From MaRDI portal
The following pages link to A linear time erasure-resilient code with nearly optimal recovery (Q3129459):
Displaying 10 items.
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- Compact proofs of retrievability (Q2392096) (← links)
- Exact emulation of a priority queue with a switch and delay lines (Q2432273) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- (Q5857610) (← links)
- (Q5875528) (← links)
- Codes on graphs: Recent progress (Q5951414) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
- Two classes of LDPC codes from the space of Hermitian matrices over finite fields (Q6112218) (← links)
