Efficient erasure correcting codes

By Michael Luby, Michael M. Mitzenmacher, Amin Shokrollahi, Daniel A. Spielman. IEEE Transactions on Information Theory, 2001

1,273 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/57beaeccb087051c23af77ab444ba4a42fd4c7cd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

In Molecular Biology

Citations in the corpus

A digital fountain approach to asynchronous reliable multicast (2002, methodology): “The first alternative we propose to avoid the problems of RS codes is to use Tornado codes [18].”
Using redundancy to cope with failures in a delay tolerant network (2005, methodology): “There are several well known cases in which erasure codes are used to cope with packet transmission failures [3, 12, 10].”
Raptor codes on binary memoryless symmetric channels (2006, background): “[8], [2], [3] were the first to prove that an appropriately chosen but highly irregular graph structure can yield to superior performance of the BP decoder as compared to case when regular graphs are used.”
Growth codes: maximizing sensor network data persistence (2006, methodology): “These can either be optimal erasure codes such as Reed-Solomon [17] or erasure codes based on sparse bipartite graphs such as Tornado [20] or LT codes [18] which trade efficiency of the code for fast encoding/decoding time.”
Invertible bloom lookup tables (2011, background): “, see [14]), that have, in some ways, the same flavor as this construction4.”
Erasure Coding in Windows Azure Storage (2012, background): “This di rection was originally pioneered for communication by landmark papers on Low Density Parity Check (LDPC) codes [15, 16].”
Extrinsic information transfer functions: model and erasure channel properties (2004, background): “For example, this is done in [2], [3] for irregular LDPC codes.”
Informed content delivery across adaptive overlay networks (2002, methodology): “For example, one elegant and scalable solution is the digital fountain approach [9], whereby the content is first encoded via an erasure-resilient encoding [19], [28], then transmitted to clients.”
Polar Codes for Channel and Source Coding (2009, methodology): “Some of the first and important contributions to the analysis of message-passing algorithms was done in a series of papers by Luby, Mitzenmacher, Shokrollahi, Spielman and Stemann [25, 26, 27, 28].”
Network coding for efficient communication in extreme networks (2005, background): “In [5], Fall mentions that using message replication or more sophisticated coding techniques such as erasure coding [17] together with probabilistic routing are possible candidates.”