Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators

Simple item page
dc.creatorWeber, Jos H.
dc.creatorAbdel-Ghaffar, Khaled A. S.
dc.date2006-07-07
dc.date.accessioned2026-07-07T08:16:37Z
dc.date.available2026-07-07T08:16:37Z
dc.descriptionThe 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 explicitly 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 weight enumerator.
dc.description8 pages, submitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0607024
dc.identifierhttp://arxiv.org/abs/cs/0607024
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133844
dc.subjectInformation Theory
dc.titleResults on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators
dc.typetext

Files

Collections

arXiv