Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes

Simple item page
dc.creatorAbdel-Ghaffar, Khaled A. S.
dc.creatorWeber, Jos H.
dc.date2006-03-02
dc.date.accessioned2026-07-07T08:16:23Z
dc.date.available2026-07-07T08:16:23Z
dc.descriptionStopping 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, McEliece 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 correspondence, we derive an expression for the number of stopping sets of any given size for the same parity-check matrix.
dc.description7 pages, submitted to the IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0603007
dc.identifierhttp://arxiv.org/abs/cs/0603007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133762
dc.subjectInformation Theory
dc.titleComplete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
dc.typetext

Files

Collections

arXiv