Lossless source coding for multiple access networks

Zhao, Qian and Effros, Michelle (2001) Lossless source coding for multiple access networks. In: IEEE International Symposium on Information Theory (ISIT '01), Washington, DC, 24-29 June 2001. IEEE , Piscataway, NJ, p. 285. ISBN 0-7803-7123-2 http://resolver.caltech.edu/CaltechAUTHORS:ZHAisit01

Preview

PDF
See Usage Policy.
134Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:ZHAisit01

Abstract

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of jointly distributed information sequences {Xi}i=1∞ and {Yi}i=1∞ is drawn i.i.d. according to joint probability mass function (p.m.f.) p(x,y); the encoder for each source operates without knowledge of the other source; the decoder receives the encoded bit streams of both sources. The rate region for MASCs with arbitrarily small but non-zero error probabilities was studied by Slepian and Wolf. In this paper, we consider the properties of optimal truly lossless MASCs and apply our findings to practical truly lossless and near lossless code design.

Item Type:	Book Section
Additional Information:	© Copyright 2001 IEEE. Reprinted with permission. This material is based upon work supported by NSF Award No. CCR-9909026 and Caltech’s Lee Center for Advanced Networks.
Subject Keywords:	decoding, multi-access systems, sequences, source coding, source coding theory, network information theory
Record Number:	CaltechAUTHORS:ZHAisit01
Persistent URL:	http://resolver.caltech.edu/CaltechAUTHORS:ZHAisit01
Alternative URL:	http://dx.doi.org/10.1109/ISIT.2001.936148
Usage Policy:	No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:	7391
Collection:	CaltechAUTHORS
Deposited By:	Archive Administrator
Deposited On:	08 Feb 2007
Last Modified:	26 Dec 2012 09:31

Repository Staff Only: item control page