2011/10/16 by Shirin Jalali, Jalali, Shirin, Michelle Effros +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Cooperative Communication and Network Coding #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1110.3559
Submitted to the IEEE Transactions on Information Theory
openalex publication_date 2011/10/16 · arxiv created 2012/12/18 · arxiv updated 2012/12/19 · openalex created_date 2022/09/18 · openalex updated_date 2026/07/28
In this paper we prove the separation of source-network coding and channel\ncoding in wireline networks. For the purposes of this work, a wireline network\nis any network of independent, memoryless, point-to-point, finite-alphabet\nchannels used to transmit dependent sources either losslessly or subject to a\ndistortion constraint. In deriving this result, we also prove that in a general\nmemoryless network with dependent sources, lossless and zero-distortion\nreconstruction are equivalent provided that the conditional entropy of each\nsource given the other sources is non-zero. Furthermore, we extend the\nseparation result to the case of continuous-alphabet, point-to-point channels\nsuch as additive white Gaussian noise (AWGN) channels.\n