A linear time erasure-resilient code with nearly optimal recovery

DOI10.1109/18.556669zbMATH Open0873.94024OpenAlexW2024581747MaRDI QIDQ3129459FDOQ3129459

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

Recommendations

• Efficient erasure correcting codes
• Publication:4502612
• scientific article; zbMATH DE number 1559530
• Linear-time encodable and decodable error-correcting codes
• Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (15)

• Exact emulation of a priority queue with a switch and delay lines
• Codes on graphs: Recent progress
• Title not available (Why is that?)
• Title not available (Why is that?)
• Erasure-resilient codes from affine spaces
• Compact proofs of retrievability
• Linear-time list recovery of high-rate expander codes
• Matrix structure and loss-resilient encoding/decoding
• Local List Recovery of High-Rate Tensor Codes and Applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scalable secure storage when half the system is faulty
• Two classes of LDPC codes from the space of Hermitian matrices over finite fields
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
• Efficient erasure correcting codes

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)