A strong converse for joint source-channel coding

Da, Wang; Ingber, Amir; Kochman, Yuval

doi:10.1109/isit.2012.6283736

Cited by 8 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For any threshold D > D * ∞ we have that ǫ(D) is exponentially small, with upper and lower bounds on the exponents (which agree for low enough D) given in [6]. To the contrary, for any D < D * ∞ it holds that 1 − ǫ(D) is exponentially small [7]. The dispersion, i.e., convergence of D to D * ∞ for fixed excess-distortion probability, as well as finite-blocklength bounds, were derived in [8], [9].…”

Section: Introductionmentioning

confidence: 89%

See 1 more Smart Citation

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

Kochman¹,

Ordentlich²,

Polyanskiy

2019

2019 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

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 Ω(n −1/2 ) above the asymptotic value, if the "bandwidth expansion ratio" is above 1.

show abstract

Section: Introductionmentioning

confidence: 89%

“…Following the treatment of the Gaussian-quadratic case in [15], we consider the case where the distortion of the "weak" user is optimal. That is, let D * 2 = D(ρ, δ 1 * δ 2 ), where the function D(ρ, δ) is as defined in (7). For the special case of D 2 = D * 2 .…”

Section: B Binary-hamming Casementioning

confidence: 99%

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

Kochman¹,

Ordentlich²,

Polyanskiy

2019

2019 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Wang, Ingber, and Kochman [7] recently proved that the noexcess-distortion probability has an exponential behavior for any lossy joint source-channel codes with fixed-length joint source-channel coding under the condition that R(D) > C (assuming that the source and channel blocklengths are the same). Furthermore, they showed that the best exponential behavior (or strong converse exponent) is attainable by a separation-based scheme.…”

Section: A Related Workmentioning

confidence: 99%

The Reliability Function of Variable-Length Lossy Joint Source-Channel Coding With Feedback

Truong

Tan

2019

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be equal to max{0, B(1 − R(D)/C)}, where R(D) is the ratedistortion function of the source, B is the maximum relative entropy between output distributions of the DMC, and C is the Shannon capacity of the channel. We show that in this asymptotic regime, separate source-channel coding is, in fact, optimal.

show abstract

“…In transmitting a DMS over a DMC the cases of average distortion level and maximal distortion level coincide [11]. However, for other channels this is not always the case even for DMS's.…”

Section: Introductionmentioning

confidence: 99%