Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview

Simple item page
dc.creatorSason, Igal
dc.creatorShamai, Shlomo
dc.date2005-12-18
dc.date.accessioned2026-07-07T08:15:49Z
dc.date.available2026-07-07T08:15:49Z
dc.descriptionUpper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, sphere-packing bounds, and information-theoretic bounds on the bit error probability of codes defined on graphs. A comprehensive overview is provided in a monograph by the authors which is currently in preparation.
dc.description6 pages, 3 figures. Accepted for presentation in Fourth International Symposium on Turbo Codes and Related Topics, Munich, Germany, 3--7 April, 2006
dc.identifierhttps://arxiv.org/abs/cs/0512074
dc.identifierhttp://arxiv.org/abs/cs/0512074
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133572
dc.subjectInformation Theory
dc.titleAnalytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview
dc.typetext

Files

Collections

arXiv