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

JH Weber, KAS Abdel-Ghaffar

    Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review


    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.
    Original languageUndefined/Unknown
    Title of host publicationITW'06: Proceedings of 2006 IEEE information theory workshop
    Editors s.n.
    Place of Publications.l.
    Number of pages5
    ISBN (Print)1442400686
    Publication statusPublished - 2006
    EventConferentie, Chengu, PR China - s.l.
    Duration: 22 Oct 200626 Oct 2006

    Publication series

    PublisherIEEE press


    ConferenceConferentie, Chengu, PR China


    • conference contrib. refereed
    • Conf.proc. > 3 pag

    Cite this