A linear time erasure-resilient code with nearly optimal recovery

DOI10.1109/18.556669zbMath0873.94024OpenAlexW2024581747MaRDI QIDQ3129459

Michael Luby, Noga Alon

Publication date: 20 October 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.556669

zbMATH Keywords

Reed-Solomon codesMDS codesreal-time transmissionerasure-resilient codelossy pocket networksredundancy encoding

Mathematics Subject Classification ID

Circuits, networks (94C99) Other types of codes (94B60) Cyclic codes (94B15)

Related Items (10)

Linear-time list recovery of high-rate expander codes ⋮ Compact proofs of retrievability ⋮ Unnamed Item ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ Two classes of LDPC codes from the space of Hermitian matrices over finite fields ⋮ Unnamed Item ⋮ Exact emulation of a priority queue with a switch and delay lines ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Codes on graphs: Recent progress ⋮ Scalable secure storage when half the system is faulty

This page was built for publication: A linear time erasure-resilient code with nearly optimal recovery