LT codes

By Michael Luby. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2002

3,176 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/099020e7149cb4586f2cae98ee2c8c45b081bc56

How researchers see this paper

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

In Artificial Intelligence

In Computer Networks and Communications

Citations in the corpus

On-the-fly verification of rateless erasure codes for efficient content distribution (2004, background): “Developments in practical erasure codes [2] and rateless erasure codes [3], [4], [5] point to elegant solutions for both problems.”
Peak-To-Average Power Ratio Reduction in OFDM Systems: A Survey And Taxonomy (2013, background): “The first practical realization of fountain codes was the LT codes [172]”
Raptor codes (2009, background): “Foundations and Trends R (cid:13) in Communications and Information Theory will publish survey and tutorial articles in the following topics:”
Survey on Free Space Optical Communication: A Communication Theory Perspective (2014, methodology): “is raptor coding [243], [244] which consists of concatenating an inner code with an outer Luby Transform (LT) code [245].”
Decentralized erasure codes for distributed networked storage (2006, methodology): “One key property of fountain codes [19], [25], is that they create every encoded packet independently and therefore have no predetermined rate (rateless property).”
Informed content delivery across adaptive overlay networks (2002, background): “Current implementations are capable of efficiently reconstructing the file, having received only a few percent more than the number of symbols in the original file [9], [18], [19].”
SplitStream: high-bandwidth multicast in cooperative environments (2003, methodology): “native is the use of rateless codes [24, 26], which provide a simple approach to coordinating redundancy, both across stripes and within each stripe.”
Using a CMOS camera sensor for visible light communication (2012, positive): “As far as future work is concerned, in order to increase the data rate, the application of the Luby Transform (LT) codes is to be investigated [5].”
Bullet: high bandwidth data dissemination using an overlay mesh (2003, methodology): “Depending on the type of data being transmitted, Bullet can optionally employ a variety of encoding schemes, for instance Erasure codes [7, 26, 25] or Multiple Description Coding (MDC) [17], to e(cid:14)-ciently disseminate data, adapt to variable bandwidth, and recover from losses.”
Network Coding for Distributed Storage Systems (2007, background): “Our paper is based on similar ideas but the storage systems have different performance metrics that need to be analyzed.”
Rateless codes on noisy channels (2004, background): “In a recent landmark paper, Luby [8] circumvented these problems by designing rateless codes which are not obtained by puncturing standard block codes.”
High Availability in DHTs: Erasure Coding vs. Replication (2005, background): “This allows us to draw more precise conclusions about the advantages of using coding or replication (Section 5).”
Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication (2018, methodology): “To decode the desired matrix vector product b = Ax from a subset of md symbols of be we use the the iterative peeling decoder described in [15]–[17].”
Capacity of wireless erasure networks (2006, neutral): “Table I summarizes our notation.”
Full length article: On coding for reliable communication over packet networks (2008, neutral): “show the asymptotic rate optimality of a speciﬁc scheme that we believe may be practicable and that can be considered as the prototype for a family of related, improved schemes; for example, LT codes [8], Raptor codes [9], Online codes [10], RT oblivious erasure-correcting codes [11], and the greedy”
Reliability in wireless sensor networks: A survey and challenges ahead (2015, positive): “FBcast uses fountain codes [49], a class of erasure codes, producing an encoded block of data on-the-fly without any dependence on the limited buffer space.”