• DocumentCode
    3505444
  • Title

    Tree interactive encoding and decoding: Conditionally Φ-mixing sources

  • Author

    Meng, Jin ; Yang, En-Hui ; Zhang, Zhen

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    1871
  • Lastpage
    1875
  • Abstract
    Interactive encoding and decoding with tree decoding (referred to simply as tree interactive encoding and decoding (TRIED)) is considered for the problem of lossless source coding with decoder only side information. A TRIED scheme is proposed and demonstrated that when applied to encode any conditionally Φ-mixing source of length n, its error probability decays polynomially with respect to n, average rate is around conditional entropy rate, and average computational complexity of encoding and decoding is O(n ln n).
  • Keywords
    computational complexity; entropy codes; error statistics; source coding; tree codes; Φ-mixing sources; TRIED scheme; computational complexity; conditional entropy rate; error probability; lossless source coding; tree interactive encoding and decoding; Channel coding; Complexity theory; Decoding; Error probability; Source coding; Tin;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
  • Conference_Location
    St. Petersburg
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4577-0596-0
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2011.6033875
  • Filename
    6033875