• DocumentCode
    2002905
  • Title

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

  • Author

    Nayak, Jayanth ; Tuncel, Ertem ; Rose, Kenneth

  • Author_Institution
    Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
  • fYear
    2003
  • fDate
    29 June-4 July 2003
  • Firstpage
    141
  • 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 Gu and channel characteristic graph Gx. 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 Gu, χ(Gu). The largest index set from which we can map to the channel alphabet is the stability number of Gx, α(Gx).
  • Keywords
    combined source-channel coding; decoding; graph theory; channel characteristic graph; chromatic number; decoder; source confusability graph; source side information; zero-error source-channel coding; Channel capacity; Channel coding; Decoding; Distributed computing; Laboratories; Memoryless systems; Probability distribution; Random variables; Source coding; Stability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2003. Proceedings. IEEE International Symposium on
  • Print_ISBN
    0-7803-7728-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2003.1228155
  • Filename
    1228155