hal-00290797, version 1
How to Find Good Finite-Length Codes: From Art Towards Science
European Transactions on Telecommunications 18 (2007) 385
- 1 :
-
http://www.lpt.ens.fr/
CNRS : UMR8549 – Université Pierre et Marie Curie [UPMC] - Paris VI – Ecole normale supérieure de Paris - ENS Paris 24 rue Lhomond, 75231 Paris CEDEX 05 France - 2 :
-
http://www.dimi.uniud.it
Università degli studi di Udine Italie
Références bibliographiques
- Type de publication : Articles dans des revues avec comité de lecture
- Domaine : Informatique/Théorie de l'information et codage
- Titre : How to Find Good Finite-Length Codes: From Art Towards Science
- Résumé : 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.
- Langue du texte
intégral : Anglais - Date de production,
écriture : 13/07/2006 - Journal :
European Transactions on Telecommunications Publisher John Wiley & Sons ISSN 1124-318X (eISSN : 1541-8251) - Audience : internationale
- Date de publication : 2007
- Volume : 18
- Page, identifiant, ... : 385
- Commentaire : 13 pages, 13 eps figures, enhanced version of an invited paperat the 4th International Symposium on Turbo Codes and Related Topics, Munich, Germany, 2006
- hal-00290797, version 1
- http://hal.archives-ouvertes.fr/hal-00290797
- oai:hal.archives-ouvertes.fr:hal-00290797
- Contributeur :
- Soumis le : Jeudi 26 Juin 2008, 14:51:18
- Dernière modification le : Jeudi 26 Juin 2008, 14:51:18
Documents associés
Exporter