Code design for lossless multiterminal networks Conference Paper uri icon

abstract

  • We consider a general multitenninal (MT) system which consists of L encoders and P decoders. Let X 1 ,...,X L be memoryless, uniform, correlated random binary vectors of length n, and let X 1 ,...,X L denote their realizations. Let further 52 = {1,...,L}. The i-th encoder compresses Xi independently from other encoders. The j-th decoder receives the bitstreams from a set of encoders ∑ i ⊆ ∑ and jointly decodes them. It should reconstruct the received source messages with arbitrarily small probability of error. To construct a practical coding scheme for this network, we exploit the fact that such a network can be split into P subnetworks, each being regarded as a Slepian-Wolf (SW) coding system with multiple sources. This SW subnetwork consists of a decoder which receives encodings of all X k 's such that k ∈ ∑ sw ⊆ ∑ and attempts to reconstruct them perfectly. Based on, we first provide a code design for this setting, and then extend it to the general case.

published proceedings

  • 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS

author list (cited authors)

  • Stankovic, V., Liveris, A. D., Xiong, Z. X., Georghiades, C. N., & IEEE

complete list of authors

  • Stankovic, V||Liveris, AD||Xiong, ZX||Georghiades, CN

publication date

  • October 2004

publisher