Back to Search
Start Over
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding.
- Source :
-
IEEE Transactions on Information Theory . Aug2020, Vol. 66 Issue 8, p4722-4741. 20p. - Publication Year :
- 2020
-
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^{-1/2}$. 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 $\Omega (n^{-1/2})$ above the asymptotic value, if the “bandwidth expansion ratio” is above 1. [ABSTRACT FROM AUTHOR]
- Subjects :
- *ERROR rates
*MEMORYLESS systems
*CIPHERS
*BROADCAST channels
*BANDWIDTHS
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 66
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 144615711
- Full Text :
- https://doi.org/10.1109/TIT.2020.2983148