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

• Published in: Proceedings DCC 2001. Data Compression Conference pp. 263 - 272
• Main Authors: Qian Zhao, Effros, M.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2001
• Subjects: Algorithm design and analysis; Arithmetic; Central Processing Unit; Decoding; Error probability; Intelligent networks; Sensor systems; Source coding; Transmitters
• ISBN: 0769510310; 9780769510316
• ISSN: 1068-0314
• DOI: 10.1109/DCC.2001.917157

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {X/sub i/}/sub i=1//sup /spl infin// and {Y/sub i/}/sub i=1//sup /spl infin// 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.