On parity-check matrices with optimal stopping and/or dead-end set enumerators

KAS Abdel-Ghaffar, JH Weber

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

    Abstract

    The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or equivalently, the parity-check matrix representing the code. In this paper, we introduce the notion of dead-end sets to explicity demonstrate this dependency. The choice of the parity-check matrix entails a trade-off between performance and complexity. We give bounds on the complexity of iterative decoders achieving optimal performance in terms of the sizes of the underlying parity-check matrices. Further, we fully characterize codes for which the optimal stopping set enumerator equals the wieght enumerator.
    Original languageUndefined/Unknown
    Title of host publicationTURBO - CODING - 2006
    Editors s.n.
    Place of PublicationBerlin
    PublisherVDE Verlag GMBH
    Pages1-6
    Number of pages6
    ISBN (Print)3800729474
    Publication statusPublished - 2006
    EventConferentie, Munich, D - Berlin
    Duration: 3 Apr 20067 Apr 2006

    Publication series

    Name
    PublisherVDE Verlag GmbH

    Conference

    ConferenceConferentie, Munich, D
    Period3/04/067/04/06

    Keywords

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

    Cite this