Channel Coding and Source Coding With Increased Partial Side Information

• Published in: Entropy (Basel, Switzerland) Vol. 19; no. 9; p. 467
• Main Authors: Sadeh-Shirazi, Avihay, Basher, Uria, Permuter, Haim
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01-09-2017
• Subjects: Blahut–Arimoto algorithm; Channel capacity; channel coding; Codes; Coding; Communication channels; Computational geometry; Convexity; Distortion; duality; Gelfand–Pinsker channel coding; Optimization; partial side information; rate-distortion; source coding; Wyner-Ziv source coding
• ISSN: 1099-4300; 1099-4300
• DOI: 10.3390/e19090467

Let (S1,i,S2,i)∼i.i.dp(s1,s2) , i=1,2,⋯ be a memoryless, correlated partial side information sequence. In this work, we study channel coding and source coding problems where the partial side information (S1,S2) is available at the encoder and the decoder, respectively, and, additionally, either the encoder’s or the decoder’s side information is increased by a limited-rate description of the other’s partial side information. We derive six special cases of channel coding and source coding problems and we characterize the capacity and the rate-distortion functions for the different cases. We present a duality between the channel capacity and the rate-distortion cases we study. In order to find numerical solutions for our channel capacity and rate-distortion problems, we use the Blahut-Arimoto algorithm and convex optimization tools. Finally, we provide several examples corresponding to the channel capacity and the rate-distortion cases we presented.