## Abstract

A key result of classical information theory states that if the rate of a randomly generated codebook is less than the mutual information between the channel's input and output, then the probability that that codebook has negligible error goes to one as the blocklength goes to infinity. In an attempt to bridge the gap between the probabilistic world of classical information theory and the combinatorial world of zero-error information theory, this work derives necessary and sufficient conditions on the rate so that the probability that a randomly generated codebook operated under list decoding (for any fixed list size) has zero error probability goes to one as the blocklength goes to infinity. Furthermore, this work extends the classical birthday problem to an information-theoretic setting, which results in the definition of a 'noisy' counterpart of Rényi entropy, analogous to how mutual information can be considered a noisy counterpart of Shannon entropy.

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

Article number | 9500216 |

Pages (from-to) | 5791-5803 |

Number of pages | 13 |

Journal | IEEE Transactions on Information Theory |

Volume | 67 |

Issue number | 9 |

DOIs | |

State | Published - Sep 2021 |

Externally published | Yes |

### Bibliographical note

Publisher Copyright:© 1963-2012 IEEE.

## Keywords

- Birthday problem
- Körner graph entropy
- Motzkin-Straus theorem
- Rényi entropy
- collision probability
- hash function
- hypergraph
- list decoding
- random coding
- zero-error channel capacity