Name
Abstract | ||
|---|---|---|
We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the long-standing open problem of finding the rate of convergence of the smallest attainable expected distortion to its asymptotic value, as a function of the blocklength n. Our main result is that in general the convergence rate is not faster than n
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-1/2</sup>
. In particular, we show that for the problem of transmitting i.i.d uniform bits over a binary symmetric channels with Hamming distortion, the smallest attainable distortion (bit error rate) is at least Ω(n
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-1/2</sup>
) above the asymptotic value, if the “bandwidth expansion ratio” is above 1. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TIT.2020.2983148 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Joint source-channel coding,finite blocklength,binary symmetric channel (BSC),broadcast channel | Journal | 66 |
Issue | ISSN | Citations |
8 | 0018-9448 | 1 |
PageRank | References | Authors |
0.37 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuval Kochman | 1 | 226 | 26.22 |
| Or Ordentlich | 2 | 121 | 18.37 |
| yury polyanskiy | 3 | 1141 | 87.77 |