Ozarow- Type Outer Bounds for Memoryless Sources and Channels

Two problems, namely multiple-description source coding and joint source-channel broadcasting of a common source, are addressed. For the multiple-description problem, we revisit Ozarow's technique for establishing impossibility results, and extend it to general sources and distortion measures. For the problem of sending a source over a broadcast channel, we revisit the bounding technique of Reznik, Feder and Zamir, and extend it to general sources, distortion measures and broadcast channels. Although the obtained bounds do not improve over existing results in the literature, they are relatively easy to evaluate, and their derivation reveals the similarities between the two bounding techniques.

[1]  Jun Chen,et al.  A Lower Bound on the Sum Rate of Multiple Description Coding With Symmetric Distortion Constraints , 2014, IEEE Transactions on Information Theory.

[2]  Abbas El Gamal,et al.  Achievable rates for multiple descriptions , 1982, IEEE Trans. Inf. Theory.

[3]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[4]  Jun Chen,et al.  A Source-Channel Separation Theorem With Application to the Source Broadcast Problem , 2016, IEEE Trans. Inf. Theory.

[5]  Rudolf Ahlswede,et al.  The rate-distortion region for multiple descriptions without excess rate , 1985, IEEE Trans. Inf. Theory.

[6]  Jun Chen,et al.  A Source-Channel Separation Theorem With Application to the Source Broadcast Problem , 2014, IEEE Transactions on Information Theory.

[7]  M. Feder,et al.  Distortion bounds for broadcasting with bandwidth expansion , 2002, The 22nd Convention on Electrical and Electronics Engineers in Israel, 2002..

[8]  Emina Soljanin,et al.  Distortion bounds for broadcasting a binary source over binary erasure channels , 2013, 2013 13th Canadian Workshop on Information Theory.

[9]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.

[10]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

[11]  Jun Chen,et al.  Outer Bounds on the Admissible Source Region for Broadcast Channels With Correlated Sources , 2015, IEEE Transactions on Information Theory.

[12]  L. Ozarow,et al.  On a source-coding problem with two channels and three receivers , 1980, The Bell System Technical Journal.