A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
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 rate of convergence of the smallest attainable expected distortion to its asymptotic value, as a function of blocklength n. Our main result is t...
Main Authors: | Kochman, Yuval, Ordentlich, Or, Polyanskiy, Yury |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
Online Access: | https://hdl.handle.net/1721.1/129803 |
Similar Items
-
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
by: Kochman, Yuval, et al.
Published: (2021) -
Ozarow-type outer bounds for memoryless sources and channels
by: Kochman, Yuval, et al.
Published: (2020) -
Results on combinatorial joint source-channel coding
by: Kochman, Yuval, et al.
Published: (2013) -
The adversarial joint source-channel problem
by: Kochman, Yuval, et al.
Published: (2013) -
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels
by: Ordentlich, Or, et al.
Published: (2019)