### 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 C_{d}(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 C_{eo} (W) = C(W). We then show that the lower bound on d-capacity given previously by past studies, is not tight in general but C_{d}(W) > iff this bound is positive. The 'product space' improvement of the lower bound is considered, and a 'product space characterization' of C_{eo}(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 language | English |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Publisher | IEEE |

Publication status | Published - 1994 |

Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |

### Other

Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
---|---|

City | Trodheim, Norw |

Period | 6/27/94 → 7/1/94 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*IEEE.

**Channel capacity for a given decoding metric.** / Csiszár, I.; Narayan, Prakash.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*IEEE, Proceedings of the 1994 IEEE International Symposium on Information Theory, Trodheim, Norw, 6/27/94.

}

TY - GEN

T1 - Channel capacity for a given decoding metric

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028720754&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028720754&partnerID=8YFLogxK

M3 - Conference contribution

BT - IEEE International Symposium on Information Theory - Proceedings

PB - IEEE

ER -