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 2001 | public
Book Section - Chapter Open

Optimal code design for lossless and near lossless source coding in multiple access networks

Abstract

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}i=1∞ and {Yi }i=1∞ is drawn i.i.d. according to the 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 (1973) describes all rates achievable by MASCs with arbitrarily small but non-zero error probabilities but does not address truly lossless coding or code design. We consider practical code design for lossless and near lossless MASCs. We generalize the Huffman and arithmetic code design algorithms to attain the corresponding optimal MASC codes for arbitrary p.m.f. p(x,y). Experimental results comparing the optimal achievable rate region to the Slepian-Wolf region are included.

Additional Information

© Copyright 2001 IEEE. Reprinted with permission. This material is based upon work supported by NSF under Award No. CCR-9909026.

Files

ZHAdcc01.pdf
Files (634.9 kB)
Name Size Download all
md5:07b6d869e1e8e249ac9a2781e63124f2
634.9 kB Preview Download

Additional details

Created:
August 21, 2023
Modified:
August 21, 2023