On the Asymptotic Performance of Iterative Decoders for Product Codes

Simple item page
dc.creatorSchwartz, Moshe
dc.creatorSiegel, Paul H.
dc.creatorVardy, Alexander
dc.date2005-08-20
dc.date.accessioned2026-07-07T08:17:50Z
dc.date.available2026-07-07T08:17:50Z
dc.descriptionWe consider hard-decision iterative decoders for product codes over the erasure channel, which employ repeated rounds of decoding rows and columns alternatingly. We derive the exact asymptotic probability of decoding failure as a function of the error-correction capabilities of the row and column codes, the number of decoding rounds, and the channel erasure probability. We examine both the case of codes capable of correcting a constant amount of errors, and the case of codes capable of correcting a constant fraction of their length.
dc.descriptionTo appear in The International Symposium on Information Theory 2005 (ISIT2005)
dc.identifierhttps://arxiv.org/abs/cs/0508085
dc.identifierhttp://arxiv.org/abs/cs/0508085
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134232
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectE.4
dc.titleOn the Asymptotic Performance of Iterative Decoders for Product Codes
dc.typetext

Files

Collections

arXiv