Complete enumeration of stopping sets of full-rank parity-check matrices of hamming codes

KAS Abdel-Ghaffar, JH Weber

    Research output: Contribution to journalArticleScientificpeer-review


    Stopping sets, and in particular their numbers and sizes play an important role in determining the performance of iterative decoders of linear codes over binary erasure channels. In the 2004 Shannon Lecture, McElievve presented ans expression for the number of stopping sets of size three for a full-rank parity-check matrix of the Hamming code. In this correspondence, we derive an expression for the number of stopping sets of any given size for the same parity-check matrix.
    Original languageUndefined/Unknown
    Pages (from-to)3196-3201
    Number of pages6
    JournalIEEE Transactions on Information Theory
    Issue number9
    Publication statusPublished - 2007


    • professional journal papers
    • CWTS JFIS >= 2.00

    Cite this