Successive Refinement With Decoder Cooperation and Its Channel Coding Duals

We study cooperation in multiterminal source coding models involving successive refinement. Specifically, we study the case of a single encoder and two decoders, where the encoder provides a common description to both the decoders and a private description to only one of the decoders. The decoders cooperate via cribbing, i.e., the decoder with access only to the common description is allowed to observe, in addition, a deterministic function of the reconstruction symbols produced by the other. We characterize the fundamental performance limits in the respective settings of noncausal, strictly causal, and causal cribbing. We use a coding scheme, referred to as Forward Encoding and Block Markov Decoding, which builds on one recently used by Cuff and Zhao for coordination via implicit communication. Finally, we use the insight gained to introduce and solve some dual-channel coding scenarios involving multiple-access channels with cribbing.

[1]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.

[2]  Haim H. Permuter,et al.  Coordination Capacity , 2009, IEEE Transactions on Information Theory.

[3]  Shlomo Shamai,et al.  Compound Multiple-Access Channels With Partial Cooperation , 2008, IEEE Transactions on Information Theory.

[4]  Vinod M. Prabhakaran,et al.  Interference Channels With Destination Cooperation , 2009, IEEE Transactions on Information Theory.

[5]  Amos Lapidoth,et al.  The Gaussian MAC with conferencing encoders , 2008, 2008 IEEE International Symposium on Information Theory.

[6]  William Equitz,et al.  Successive refinement of information , 1991, IEEE Trans. Inf. Theory.

[7]  Hirosuke Yamamoto,et al.  Source coding theory for cascade and branching communication systems , 1981, IEEE Trans. Inf. Theory.

[8]  Hirosuke Yamamoto.  Source coding theory for a triangular communication system , 1996, IEEE Trans. Inf. Theory.

[9]  Tobias J. Oechtering,et al.  Source and channel coding with action-dependent partially known two-sided state information , 2010, 2010 IEEE International Symposium on Information Theory.

[10]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[11]  Lossy source coding for a cascade communication system with side-informations , 2006 .

[12]  Han-I Su,et al.  Cascade multiterminal source coding , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Haim H. Permuter,et al.  Channel coding and source coding with increased partial side information , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Lei Zhao,et al.  Coordination using implicit communication , 2011, 2011 IEEE Information Theory Workshop.

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

[16]  Haim Permuter,et al.  Multiple-Access Channel With Partial and Controlled Cribbing Encoders , 2013, IEEE Transactions on Information Theory.

[17]  Moritz Wiese,et al.  The Compound Multiple Access Channel With Partially Cooperating Encoders , 2011, IEEE Transactions on Information Theory.

[18]  Haim H. Permuter,et al.  Cascade, Triangular and two way source coding with degraded side information at the second user , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[19]  Wei Yu.  Duality and the Value of Cooperation in Distributive Source and Channel Coding Problems ∗ , .

[20]  Mung Chiang,et al.  Duality between channel capacity and rate distortion with two-sided state information , 2002, IEEE Trans. Inf. Theory.

[21]  Bernd Girod,et al.  Wyner-Ziv Residual Coding of Video , 2006 .

[22]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[23]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[24]  Roy D. Yates,et al.  The discrete memoryless compound multiple access channel with conferencing encoders , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[25]  Shraga I. Bross,et al.  The causal cognitive interference channel , 2010 .

[26]  Andrea J. Goldsmith,et al.  Capacity and Cooperation in Wireless Networks , 2006 .

[27]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

[28]  Sergio Verdú,et al.  Operational duality between Gelfand-Pinsker and Wyner-Ziv coding , 2010, 2010 IEEE International Symposium on Information Theory.

[29]  Kannan Ramchandran,et al.  Duality between source coding and channel coding and its extension to the side information case , 2003, IEEE Trans. Inf. Theory.

[30]  Valeriu Soltan,et al.  Lectures on Convex Sets , 2019 .

[31]  Ramji Venkataramanan,et al.  Achievable Rates for Multiple Descriptions With Feed-Forward , 2011, IEEE Transactions on Information Theory.

[32]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[33]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[34]  Vinod M. Prabhakaran,et al.  Interference Channels With Source Cooperation , 2011, IEEE Transactions on Information Theory.

[35]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[36]  Haim H. Permuter,et al.  Cascade and Triangular Source Coding With Side Information at the First Two Nodes , 2010, IEEE Transactions on Information Theory.