Zero-error source-channel coding with source side information at the decoder

1 January 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Abstract

This paper describes the zero-error source-channel coding with source side information at the decoder. To analyze the zero-error scenario, we define the following graphs: the source confusability graph G/sub u/ and channel characteristic graph G/sub x/. We can always find a code from a source graph to its complement. Separate source and channel coding corresponds to first mapping from the source alphabet to an index set and then mapping from the index set to the channel alphabet. The size of the smallest index set that allows a zero-error source code is the chromatic number of G/sub u/, /spl chi/(G/sub u/). The largest index set from which we can map to the channel alphabet is the stability number of G/sub x/, /spl alpha/(G/sub x/).

Keywords

This publication has 3 references indexed in Scilit:

The Shannon Capacity of a Union
Combinatorica, 1998
Source coding and graph entropies
IEEE Transactions on Information Theory, 1996
Capacity of channels with uncoded side information
European Transactions on Telecommunications, 1995