Computer Science – Information Theory
Scientific paper
2005-12-18
Computer Science
Information Theory
6 pages, 3 figures. Accepted for presentation in Fourth International Symposium on Turbo Codes and Related Topics, Munich, Ger
Scientific paper
Upper 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.
Sason Igal
Shamai Shlomo
No associations
LandOfFree
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview 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 Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-133455