Practical loss-resilient codes

  title={Practical loss-resilient codes},
  author={Michael Luby and Michael Mitzenmacher and Amin Shokrollahi and Daniel A. Spielman and Volker Stemann},
  booktitle={STOC '97},
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encod-ing and decoding algorithms for these codes have fast and simple software implementations. Partial implementationsof our algorithms are faster by orders of magnitude than the best software implementations of any previous algorithm forthis problem. We expect these codes will be extremely useful for applications such as real-time… 

Figures from this paper

This thesis shows that the performance ofLDPC codes obeys a well-defined scaling law as the blocklength increases, which refines the asymptotic analysis and provides a good way to understand and approximate the behavior of LDPC codes of short to moderate length.
Efficient erasure correcting codes
A simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs is introduced and a simple criterion involving the fractions of nodes of different degrees on both sides of the graph is obtained which is necessary and sufficient for the decoding process to finish successfully with high probability.
On-Line Construction of Irregular Repeat Accumulate Codes for Packet Erasure Channels
The proposed algorithms allow designing in fast manner parity-check matrices that are suitable for low-complexity maximum-likelihood decoding that can attain codeword error rates as low as 10-5 without appreciable losses w.r.t. the performance of idealized maximum-distance separable codes.
Iterative Decoding for Wireless Networks
The performance of low density parity check codes under iterative decoding in certain simple networks and Shannon-theoretic results for more complex networks are analyzed and proved.
Linear-time encoding and decoding of low-density parity-check codes
This thesis provides a literature review of the current state-of-the-art in encoding and decoding of LDPC codes, showing that the stochastic bitipping decoder provides relatively good error-correcting performance with low complexity.
Random Matrices and Codes for the Erasure Channel
This work considers a new class of random codes which have the following advantages: (i) the overhead is constant (in the range of 5 to 10), independent of the number of data symbols being encoded (ii) the probability of completing decoding for such an overhead is essentially one (iii) the codes are effective for a number of information symbols as low as a few tens (iv) the only probability distribution required is the uniform distribution.
Generic Architecture for LDPC Codes Decoding
A suboptimal algorithm named the λ-min algorithm is proposed, which reduces significantly the complexity of the decoder without any significant performance loss, as compared to the belief propagation (BP) algorithm.
Iterative Coding for Network Coding
A systematic oblivious random channel model based on random sparse graphs and a low-complexity decoding algorithm is introduced that achieves the channel capacity in complexity which is jointly quadratic in the number of coded information bits and sublogarithmic in the error probability.
Optimization of the Belief Propagation algorithm for Luby Transform decoding over the Binary Erasure Channel.
This project explores optimisations of the BP decoding process for LT codes when the number of information symbols is small, and presents two new decoding algorithms that improve the performance of BP while keeping a low complexity.
Online codes
It is argued that rateless codes are more appropriate than fixed-rate codes for most situations where erasure codes were considered a solution, and meet new areas of application, where they are not replaceable by fixed- rate codes.


A linear time erasure-resilient code with nearly optimal recovery
We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the
Theory of Error-correcting Codes
This course expounds the principles of coded modulations for the Gaussian channel and, if time permits, for Rician and Rayleigh fading channels (fully interleaved), and reminds students of the basics of the theory of linear codes for conventional memoryless ergodic channels.
Linear time erasure codes with nearly optimal recovery
This work describes erasure codes where both the encoding and decoding algorithms run in linear time and where r is only slightly larger than n and the message is recovered from any set of packets whose total length is r.
Low-density parity-check codes
A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Linear-time encodable and decodable error-correcting codes
This work presents a new class of asymptotically good, linear error-correcting codes that can be both encoded and decoded in linear time and presents both randomized and explicit constructions of these codes.
Expander codes
  • M. Sipser, D. Spielman
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
We present a new class of asymptotically good, linear error-correcting codes based upon expander graphs. These codes have linear time sequential decoding algorithms, logarithmic time parallel
Priority encoding transmission
A novel approach for sending messages over lossy packet-based networks that allows a user to specify a different priority on each segment of the message, and an information-theoretic proof that there is no system that implements a set of priorities with rate greater than one.
Packet loss correlation in the MBone multicast network
This work experimentally and quantitatively examines the spatial and temporal correlation in packet loss among participants in a multicast session, and shows that there is some spatial correlation in loss among the multicast sites.
Theory and practice of error control codes
  • J. Massey
  • Computer Science
    Proceedings of the IEEE
  • 1986
This chapter discusses algorithmics and modular computations, Theory of Codes and Cryptography (3), and the theory and practice of error control codes (3).
Measurements and analysis of end-to-end Internet dynamics
This work describes the resulting characterizations of Internet packet loss and delay, including general assessments of queueing time scales and available bandwidth, using a distributed framework developed for conducting end-to-end measurements.