How to Find Good Finite-Length Codes: From Art Towards Science

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00290797
Contributor : Montanari Andrea <>
Submitted on : Thursday, June 26, 2008 - 2:51:18 PM
Last modification on : Friday, July 26, 2019 - 11:04:05 AM

Links full text

Identifiers

  • HAL Id : hal-00290797, version 1
  • ARXIV : cs/0607064

Citation

Abdelaziz Amraoui, Andrea Montanari, Ruediger Urbanke. How to Find Good Finite-Length Codes: From Art Towards Science. European Transactions on Telecommunications, Wiley, 2007, 18, pp.385. ⟨hal-00290797⟩

Share

Metrics

Record views

222