A Local Tree Structure is NOT Sufficient for the Local Optimality of Message-Passing Decoding in Low Density Parity Check Codes

Simple item page
dc.creatorXu, Weiyu
dc.date2007-02-25
dc.date.accessioned2026-07-07T08:17:06Z
dc.date.available2026-07-07T08:17:06Z
dc.descriptionWe address the problem,`Is a local tree structure sufficient for the local optimality of message passing algorithm in low density parity check codes?'.It is shown that the answer is negative. Using this observation, we pinpoint a flaw in the proof of Theorem 1 in the paper `The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding' by Thomas J. Richardson and Rüdiger L.Urbanke\cite{RUCapacity}. We further provide a new proof of that theorem based on a different argument.
dc.descriptionComments, submitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0702146
dc.identifierhttp://arxiv.org/abs/cs/0702146
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134011
dc.subjectInformation Theory
dc.titleA Local Tree Structure is NOT Sufficient for the Local Optimality of Message-Passing Decoding in Low Density Parity Check Codes
dc.typetext

Files

Collections

arXiv