Picture of two heads

Open Access research that challenges the mind...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including those from the School of Psychological Sciences & Health - but also papers by researchers based within the Faculties of Science, Engineering, Humanities & Social Sciences, and from the Strathclyde Business School.

Discover more...

Code design for lossless multiterminal networks

Stankovic, V. and Liveris, A.D and Xiong, Z.X. and Georghiades, C.N. (2004) Code design for lossless multiterminal networks. In: IEEE International Symposium on Information Theory, 2004-06-27 - 2004-07-02.

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

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.