Loading...
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.
Type
book part or chapter
Authors
Publication date
2002
Publisher
Published in
Theoretical Aspects of Computer Science : Advanced Lectures
Start page
175
End page
197
Series title/Series vol.
Lecture Notes in Computer Science; 2292
Subjects
EPFL units
Available on Infoscience
January 26, 2007
Use this identifier to reference this record