On decoding failure probabilities for linear block codes on the binary erasure channel

Conference paper (2006)

Authors

Jos Weber Wireless and Mobile Communications

J.H. Weber Wireless and Mobile Communications

KAS Abdel-Ghaffar External organisation

Research Group

Wireless and Mobile Communications

To reference this document use:

http://resolver.tudelft.nl/uuid:d0103d80-4cee-4a59-8e8e-0efce73590f6

More Info

expand_more

Published Date

2006

Language

Undefined/Unknown

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Research Group

Wireless and Mobile Communications

Abstract

It has been claimed that the performance of a linear block code under iterative decoding on the binary erasure channel is determined by the stoppin gdistance, i.e., the size of hte smallest non-empty stopping set in the associated Tanner graph. Indeed, this is true from the perspective of code word retrieval. However, we show that with respect to the retrieval of just the information bits within the code word, the stopping distance may not be main performance indicator since the smallest non-empty stopping sets might not hit the information set of bits carrying the information for a fixed code with a fixed decoder.