• DocumentCode
    110820
  • Title

    The Zero-Undetected-Error Capacity Approaches the Sperner Capacity

  • Author

    Bunte, Christoph ; Lapidoth, Amos ; Samorodnitsky, Alex

  • Author_Institution
    Signal & Inf. Process. Lab., ETH Zurich, Zurich, Switzerland
  • Volume
    60
  • Issue
    7
  • fYear
    2014
  • fDate
    Jul-14
  • Firstpage
    3825
  • Lastpage
    3833
  • Abstract
    Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the channel graph, and they conjectured equality. Here, we derive an upper bound that proves the conjecture.
  • Keywords
    channel capacity; graph theory; Sperner capacity; channel graph capacity; upper bound; zero-undetected-error capacity approach; Capacity planning; Decoding; Memoryless systems; Monte Carlo methods; Noise; Standards; Upper bound; Sperner capacity; directed graphs; discrete memoryless channels; zero-undetected-error capacity;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2322624
  • Filename
    6812221
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=110820