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

Simple item page
dc.creatorAmraoui, Abdelaziz
dc.creatorMontanari, Andrea
dc.creatorUrbanke, Ruediger
dc.date2006-07-13
dc.date.accessioned2026-07-07T08:16:38Z
dc.date.available2026-07-07T08:16:38Z
dc.descriptionWe 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.
dc.description13 pages, 13 eps figures, enhanced version of an invited paperat the 4th International Symposium on Turbo Codes and Related Topics, Munich, Germany, 2006
dc.identifierhttps://arxiv.org/abs/cs/0607064
dc.identifierhttp://arxiv.org/abs/cs/0607064
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133848
dc.subjectInformation Theory
dc.titleHow to Find Good Finite-Length Codes: From Art Towards Science
dc.typetext

Files

Collections

arXiv