• DocumentCode
    2923362
  • Title

    Slepian-Wolf Coding for General Sources and Its Duality with Channel Coding

  • Author

    Chen, Jun ; He, Da-Ke ; Yang, En-Hui

  • Author_Institution
    IBM T. J. Watson Res. Center, Yorktown Heights
  • fYear
    2007
  • fDate
    6-8 June 2007
  • Firstpage
    57
  • Lastpage
    60
  • Abstract
    We study the problem of Slepian-Wolf coding for general sources (not necessarily stationary) with finite alphabet. A linear codebook-level duality between Slepian-Wolf coding for general sources and channel coding for a class of cyclic-symmetric channels is established under optimal decoding, through which the general formula for the Slepian-Wolf limit can be reinterpreted using Verdu and Han´s channel capacity formula.
  • Keywords
    channel capacity; channel coding; cyclic codes; decoding; linear codes; Slepian-Wolf coding; channel capacity formula; channel coding; cyclic-symmetric channels; finite alphabet; linear codebook-level duality; optimal decoding; Additive noise; Channel capacity; Channel coding; Decoding; Entropy; Error probability; Helium; Linear code; Random variables; Zinc;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. CWIT '07. 10th Canadian Workshop on
  • Conference_Location
    Edmonton, Alta.
  • Print_ISBN
    1-4244-0769-9
  • Electronic_ISBN
    1-4244-0769-9
  • Type

    conf

  • DOI
    10.1109/CWIT.2007.375700
  • Filename
    4259754