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
Introduction to Coding Theory
New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
IEEE Transactions on Information Theory - Part 1
Linear-time encodable and decodable error-correcting codes
IEEE Transactions on Information Theory - Part 1
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory
Capacity-achieving sequences for the erasure channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper we will survey some of the most recent results on low-density parity-check codes. Our emphasis will be primarily on the asymptotic theory of these codes. For the most part, we will introduce the main concepts for the easier case of the erasure channel. We will also give an application of these methods to reliable content delivery.