ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We consider instantaneous side information source code (SISC) design.Inthe SISC configuration, the encoder describes source X to the decoder; thedecoder uses this description and side information Y (which is not available atthe encoder) to reconstruct X.Prior work on lossless and near-lossless SISCdesign demonstrates that globally optimal design is NP-hard.In this paper,we introduce a family of polynomial complexity code design algorithms thatapproximates the optimal solution for lossless and near-lossles SISCs.Thealgorithms may be used to design both Huffman and arithmetic SISCs for anarbitrary probabilty mass function p(x,y).Experimental results comparing theresulting performances to each other and to the theoretical limit are included.