Channel capacity for a given decoding metric

Imre Csiszar, Prakash Narayan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We address the rate of transmission which is attainable on a given channel when the decoding rule is specified, perhaps suboptimally. We concentrate on decoders, termed d-decoders, which accept the codeword x «closest» to the received sequence y in the sense of a metric d(x,y), defined for sequences as an additive extension of a single-letter metric. The class of d-decoders affords many interesting problems, some of which appear to be very hard; indeed, the important graph-theoretical concepts of Shannon capacity and Sperner capacity are special cases of d-capacity.

Original languageEnglish
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Number of pages1
DOIs
Publication statusPublished - Dec 1 1994
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: Jun 27 1994Jul 1 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other1994 IEEE International Symposium on Information Theory, ISIT 1994
CountryNorway
CityTrondheim
Period6/27/947/1/94

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Channel capacity for a given decoding metric'. Together they form a unique fingerprint.

  • Cite this

    Csiszar, I., & Narayan, P. (1994). Channel capacity for a given decoding metric. In Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994 [394641] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1994.394641