Computer Science – Information Theory
Scientific paper
2006-07-13
Computer Science
Information Theory
13 pages, 13 eps figures, enhanced version of an invited paperat the 4th International Symposium on Turbo Codes and Related To
Scientific paper
We explain how to optimize finite-length LDPC codes for transmission over the binary erasure channel. Our approach relies on an analytic approximation of the erasure probability. This is in turn based on a finite-length scaling result to model large scale erasures and a union bound involving minimal stopping sets to take into account small error events. We show that the performances of optimized ensembles as observed in simulations are well described by our approximation. Although we only address the case of transmission over the binary erasure channel, our method should be applicable to a more general setting.
Amraoui Abdelaziz
Montanari Andrea
Urbanke Ruediger
No associations
LandOfFree
How to Find Good Finite-Length Codes: From Art Towards Science does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How to Find Good Finite-Length Codes: From Art Towards Science, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to Find Good Finite-Length Codes: From Art Towards Science will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-480473