TY - GEN
T1 - The Ahlswede-Körner coordination problem with one-sided encoder cooperation
AU - Goldfeld, Ziv
AU - Permuter, Haim H.
AU - Kramer, Gerhard
PY - 2014/1/1
Y1 - 2014/1/1
N2 - The Ahlswede-Körner (AK) coordination problem with one-sided encoder cooperation is considered. Encoder co-operation refers to communication between the encoders via a finite-capacity one-sided link. For this setting, the coordination capacity region is derived. The optimal coding scheme leverages the link between the encoders to optimally handle the correlation between the sources. Moreover, the scheme incorporates several source coding techniques, such as Wyner-Ziv coding, binning and superposition coding. Furthermore, a dual semi-deterministic broadcast channel (BC) with one-sided cooperative decoders is considered. Transformation principles between the two problems are presented and an achievable rate region for the BC setting is derived. The region of the BC is shown to be dual to the optimal region of the AK problem in the sense that the information measures defining the corner points in both regions coincide. Although the optimality of the achievable region for the semi-deterministic BC setting is yet to be shown, the region is optimal in the fully-deterministic case.
AB - The Ahlswede-Körner (AK) coordination problem with one-sided encoder cooperation is considered. Encoder co-operation refers to communication between the encoders via a finite-capacity one-sided link. For this setting, the coordination capacity region is derived. The optimal coding scheme leverages the link between the encoders to optimally handle the correlation between the sources. Moreover, the scheme incorporates several source coding techniques, such as Wyner-Ziv coding, binning and superposition coding. Furthermore, a dual semi-deterministic broadcast channel (BC) with one-sided cooperative decoders is considered. Transformation principles between the two problems are presented and an achievable rate region for the BC setting is derived. The region of the BC is shown to be dual to the optimal region of the AK problem in the sense that the information measures defining the corner points in both regions coincide. Although the optimality of the achievable region for the semi-deterministic BC setting is yet to be shown, the region is optimal in the fully-deterministic case.
UR - http://www.scopus.com/inward/record.url?scp=84906568866&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2014.6875051
DO - 10.1109/ISIT.2014.6875051
M3 - Conference contribution
AN - SCOPUS:84906568866
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1341
EP - 1345
BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014
PB - Institute of Electrical and Electronics Engineers
T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014
Y2 - 29 June 2014 through 4 July 2014
ER -