• DocumentCode
    2275929
  • Title

    A universal lossless compressor with side information based on context tree weighting

  • Author

    Cai, Haixiao ; Kulkarni, Sanjeev R. ; Verdu, Sergio

  • Author_Institution
    Dept. of Electr. Eng., Princeton Univ., NJ
  • fYear
    2005
  • fDate
    4-9 Sept. 2005
  • Firstpage
    2340
  • Lastpage
    2344
  • Abstract
    This paper proposes a new algorithm based on the context-tree weighting method for universal compression of a finite-alphabet sequence x1 n with side information y1 n available to both the encoder and decoder. We prove that with probability one the compression ratio converges to the conditional entropy rate for jointly stationary ergodic sources. Experimental results with Markov chains and English texts show the effectiveness of the algorithm
  • Keywords
    Markov processes; codes; English texts; Markov chains; conditional entropy rate; context tree weighting method; finite-alphabet sequence; jointly stationary ergodic sources; universal lossless compressor; Arithmetic; Compression algorithms; Decoding; Entropy; Image coding; Laboratories; Pattern matching; Probability; Protocols; Video compression;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
  • Conference_Location
    Adelaide, SA
  • Print_ISBN
    0-7803-9151-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2005.1523766
  • Filename
    1523766
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2275929