### 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 language | English |
---|---|

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

Number of pages | 1 |

DOIs | |

Publication status | Published - Dec 1 1994 |

Event | 1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: Jun 27 1994 → Jul 1 1994 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8095 |

### Other

Other | 1994 IEEE International Symposium on Information Theory, ISIT 1994 |
---|---|

Country | Norway |

City | Trondheim |

Period | 6/27/94 → 7/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