Why We Can Not Surpass Capacity: The Matching Condition

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
10 pages, 27 ps figures. Forty-third Allerton Conference on Communication, Control and Computing, invited paper

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133532

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0510045
 http://arxiv.org/abs/cs/0510045

Collections

arXiv