Conference
Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss
Abstract
An l-link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graph-based codes. A successive coding scheme is proposed for converting an l-link binary CEO problem to the $(2l-1)$ single binary Wyner-Ziv (WZ) problems. By using the compound LDGM-LDPC codes, the theoretical bound of each binary WZ is asymptotically achievable. Our proposed decoder successively decodes …
Authors
Nangir; Asvadi R; Ahmadian-Attari M; Chen J
Volume
00
Pagination
pp. 1-5
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
June 7, 2018
DOI
10.1109/bsc.2018.8494701
Name of conference
2018 29th Biennial Symposium on Communications (BSC)