### Abstract

The form of Dueck and Körner's exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csiszár and Körner's exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and Körner's exponent. In this paper, we give an algorithm for computing Csiszár and Körner's exponent. The proposed algorithm can also be used to compute cutoff rate and the rate distortion function.

Original language | English |
---|---|

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

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 1531-1535 |

Number of pages | 5 |

Volume | 2016-August |

ISBN (Electronic) | 9781509018062 |

DOIs | |

Publication status | Published - Aug 10 2016 |

Event | 2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: Jul 10 2016 → Jul 15 2016 |

### Other

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

Country | Spain |

City | Barcelona |

Period | 7/10/16 → 7/15/16 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory*(Vol. 2016-August, pp. 1531-1535). [7541555] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541555

**Computing the optimal exponent of correct decoding for discrete memoryless sources.** / Jitsumatsu, Yutaka; Oohama, Yasutada.

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

*Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory.*vol. 2016-August, 7541555, Institute of Electrical and Electronics Engineers Inc., pp. 1531-1535, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 7/10/16. https://doi.org/10.1109/ISIT.2016.7541555

}

TY - GEN

T1 - Computing the optimal exponent of correct decoding for discrete memoryless sources

AU - Jitsumatsu, Yutaka

AU - Oohama, Yasutada

PY - 2016/8/10

Y1 - 2016/8/10

N2 - The form of Dueck and Körner's exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csiszár and Körner's exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and Körner's exponent. In this paper, we give an algorithm for computing Csiszár and Körner's exponent. The proposed algorithm can also be used to compute cutoff rate and the rate distortion function.

AB - The form of Dueck and Körner's exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csiszár and Körner's exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and Körner's exponent. In this paper, we give an algorithm for computing Csiszár and Körner's exponent. The proposed algorithm can also be used to compute cutoff rate and the rate distortion function.

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

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

U2 - 10.1109/ISIT.2016.7541555

DO - 10.1109/ISIT.2016.7541555

M3 - Conference contribution

AN - SCOPUS:84985911025

VL - 2016-August

SP - 1531

EP - 1535

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

ER -