A Lower Bound on the Expected Distortion of Joint Source-Channel Coding

DOI10.1109/TIT.2020.2983148zbMATH Open1446.94060arXiv1902.07979OpenAlexW3013605664WikidataQ114847625 ScholiaQ114847625MaRDI QIDQ5124459FDOQ5124459

Authors: Yuval Kochman, Or Ordentlich, Yury Polyanskiy 

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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 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$.

Full work available at URL: https://arxiv.org/abs/1902.07979

zbMATH Keywords

memoryless channelmemoryless sourcejoint source-channel coding problem

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited In (3)

• Worst sources and robust codes for difference distortion measures
• A Lower Bound on the Sum Rate of Multiple Description Coding With Symmetric Distortion Constraints
• Distortion-rate bounds for fixed- and variable-rate multiresolution source codes

This page was built for publication: A Lower Bound on the Expected Distortion of Joint Source-Channel Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124459)