Code design for lossless multiterminal networks

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

Research output: Contribution to conferencePaper

5 Citations (Scopus)


We consider a general multiterminal (NIT) system which consists of L encoders and P decoders [1]. 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 Sigma = {1,...,L}. The i-th encoder compresses Xi independently from other encoders. The j-th decoder receives the bitstreams from a set of encoders Sigma(j) subset of or equal to Sigma 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 is an element of Sigma(SW) subset of or equal to Sigma and attempts to reconstruct them perfectly. Based on [2], we first provide a code design for this setting, and then extend it to the general case.
Original languageEnglish
Number of pages1
Publication statusPublished - Jun 2004
EventIEEE International Symposium on Information Theory - Chicago, United States
Duration: 27 Jun 20042 Jul 2004


ConferenceIEEE International Symposium on Information Theory
Country/TerritoryUnited States


  • code design
  • lossless
  • multiterminal
  • networks

Cite this