2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | S.5.3 | ||
| Paper Title | Revisiting Zero-Rate Bounds on the Reliability Function of Discrete Memoryless Channels | ||
| Authors | Marco Bondaschi, Marco Dalai, University of Brescia, Italy | ||
| Session | S.5: Error Exponents | ||
| Presentation | Lecture | ||
| Track | Shannon Theory | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | We present a revised proof of Berlekamp's zero-rate upper bound on the reliability function of discrete memoryless channels, in its extended form for list-decoding as first proved by Blinovsky. The available proofs are somehow uneasy in that they contain in one form or another some cumbersome "non-standard" procedures or computations. Here we start from Blinovsky's ideas and complement them with some missing steps to present a proof which is entirely in the realm of standard information theoretic tools even for general list size. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
