Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2003 | public
Journal Article Open

Lossless and near-lossless source coding for multiple access networks


A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {X-i}(i=1)(infinity), and {Y-i}(i=1)(infinity) is drawn independent and identically distributed (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 jointly decodes the encoded bit streams from both sources. The work of Slepian and Wolf describes all rates achievable by MASCs of infinite coding dimension (n --> infinity) and asymptotically negligible error probabilities (P-e((n)) --> 0). In this paper, we consider the properties of optimal instantaneous MASCs with finite coding dimension (n < infinity) and both lossless (P-e((n)) = 0) and near-lossless (P-e((n)) --> 0) performance. The interest in near-lossless codes is inspired by the discontinuity in the limiting rate region at P-e((n)) = 0 and the resulting performance benefits achievable by using near-lossless MASCs as entropy codes within lossy MASCs. Our central results include generalizations of Huffman and arithmetic codes to the MASC framework for arbitrary p(x, y), n, and P-e((n)) and polynomial-time design algorithms that approximate these optimal solutions.

Additional Information

© Copyright 2003 IEEE. Reprinted wih permission. Manuscript received June 23, 2001; revised October 2, 2002. [Posted online: 2003-01-14] This work was supported by NSF under Awards CCR-9909026 and CCR-0220039 and by the Caltech Lee Center for Advanced Networking. The material in this paper was presented in part at the Data Compression Conference, Snowbird, UT, March 2001 and the IEEE International Symposium on Information Theory, Washington, DC, June 2001. Communicated by R. Zamir, Associate Editor for Source Coding. The authors gratefully acknowledge the detailed critiques and many helpful comments from the anonymous reviewers.


Files (1.3 MB)
Name Size Download all
1.3 MB Preview Download

Additional details

August 22, 2023
October 16, 2023