Channel capacity for a given decoding metric

Imre Csiszar, Prakash Narayan

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

We address the rate of transmission 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. We provide a simple sufficient condition for Cd(W) = C(W), and more generally, for the equality of the d-capacities for two different decoding metrics d and d̄. This is followed by a sufficient condition for Ceo (W) = C(W). We then show that the lower bound on d-capacity given previously by past studies, is not tight in general but Cd(W) > iff this bound is positive. The 'product space' improvement of the lower bound is considered, and a 'product space characterization' of Ceo(W) is obtained. We also determine the e.o. capacity of a deterministic arbitrarily varying channel defined by a bipartite graph, and show that it equals capacity.

Original languageEnglish
Publication statusPublished - Dec 1 1994
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: Jun 27 1994Jul 1 1994

Other

OtherProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period6/27/947/1/94

    Fingerprint

ASJC Scopus subject areas

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

Cite this

Csiszar, I., & Narayan, P. (1994). Channel capacity for a given decoding metric. Paper presented at Proceedings of the 1994 IEEE International Symposium on Information Theory, Trodheim, Norw, .