Enumeration of stopping sets of full-rank parity-check matrices of hammng codes

KAS Abdel-Ghaffar, JH Weber

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

    Abstract

    Iterative techniques have been proposed for decoding linear binary block codes over erasure channels. The performance of such decoding techniques depends on the parity-check matrices used, and in partivular, on the numbers and sizes of stopping sets of these matrices. In the 2004 Shannon lecture, McElliece presented an expression for the number of stopping sets of size three for a full-rank parity-check matrix of the Hamming code. In this paper, we present an expression for the number of stopping sets of any given size for the same parity-check matrix.
    Original languageUndefined/Unknown
    Title of host publicationProceedings of the twenty-seventh symposium on information theory in the Benelux
    EditorsRL Lagendijk, JH Weber
    Place of PublicationEnschede
    PublisherWIC
    Pages61-68
    Number of pages8
    ISBN (Print)9071048225
    Publication statusPublished - 2006
    EventTwenty-seventh symposium on information theory in the Benelux, Noordwijk, The Netherlands - Delft, noordwijk
    Duration: 8 Jun 20069 Jun 2006

    Publication series

    Name
    PublisherWIC

    Conference

    ConferenceTwenty-seventh symposium on information theory in the Benelux, Noordwijk, The Netherlands
    Citynoordwijk
    Period8/06/069/06/06

    Keywords

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

    Cite this

    Abdel-Ghaffar, KAS., & Weber, JH. (2006). Enumeration of stopping sets of full-rank parity-check matrices of hammng codes. In RL. Lagendijk, & JH. Weber (Eds.), Proceedings of the twenty-seventh symposium on information theory in the Benelux (pp. 61-68). WIC.