Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Concrete Math
A linear time erasure-resilient code with nearly optimal recovery
IEEE Transactions on Information Theory - Part 1
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Introduction to Low-Density Parity-Check Codes
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding
IEEE Transactions on Information Theory
LDPC code design considerations for non-uniform channels
IEEE Transactions on Communications
Simple capacity-achieving ensembles of rateless erasure-correcting codes
IEEE Transactions on Communications
Systematic design of low-density parity-check code ensembles for binary erasure channels
IEEE Transactions on Communications
Bounds on rates of LDPC codes for BEC with varying erasure rate
IEEE Transactions on Communications
New sequences of capacity achieving LDPC code ensembles over the binary erasure channel
IEEE Transactions on Information Theory
| Hi-index | 0.13 |
We will introduce a new class of erasure codes built from irregular bipartite graphs that have linear time encoding and decoding algorithms and can transmit over an erasure channel at rates arbitrarily close to the channel capacity. We also show that these codes are close to optimal with respect to the trade-off between the proximity to the channel capacity and the running time of the recovery algorithm.