SCIENCE@home

Why We Can Not Surpass Capacity: The Matching Condition

C. Méasson,A. Montanari,R. Urbanke

Published 2005 in arXiv.org

ABSTRACT

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.

PUBLICATION RECORD

  • Publication year

    2005

  • Venue

    arXiv.org

  • Publication date

    2005-10-16

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
    arXiv cs/0510045
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-19 of 19 references · Page 1 of 1

CITED BY

Showing 1-20 of 20 citing papers · Page 1 of 1