Why We Can Not Surpass Capacity: The Matching Condition

Simple item page
dc.creatorMeasson, Cyril
dc.creatorMontanari, Andrea
dc.creatorUrbanke, Rudiger
dc.date2005-10-16
dc.date.accessioned2026-07-07T08:15:42Z
dc.date.available2026-07-07T08:15:42Z
dc.descriptionWe show that iterative coding systems can not surpass capacity using only quantities which naturally appear in density evolution. Although the result in itself is trivial, the method which we apply shows that in order to achieve capacity the various components in an iterative coding system have to be perfectly matched. This generalizes the perfect matching condition which was previously known for the case of transmission over the binary erasure channel to the general class of binary-input memoryless output-symmetric channels. Potential applications of this perfect matching condition are the construction of capacity-achieving degree distributions and the determination of the number required iterations as a function of the multiplicative gap to capacity.
dc.description10 pages, 27 ps figures. Forty-third Allerton Conference on Communication, Control and Computing, invited paper
dc.identifierhttps://arxiv.org/abs/cs/0510045
dc.identifierhttp://arxiv.org/abs/cs/0510045
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133532
dc.subjectInformation Theory
dc.titleWhy We Can Not Surpass Capacity: The Matching Condition
dc.typetext

Files

Collections

arXiv