• DocumentCode
    2623158
  • Title

    Another look at universal data compression

  • Author

    Ziv, Jacob ; Hershkovitz, Yehuda

  • Author_Institution
    Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
  • fYear
    1994
  • fDate
    27 Jun-1 Jul 1994
  • Firstpage
    11
  • Abstract
    Non-asymptotic coding and converse theorems are derived for universal data-compression algorithms in cases where the training sequence (“history”) that is available to the encoder is not large enough so as to yield the ultimate compression ratio, namely the entropy of the source
  • Keywords
    binary sequences; data compression; entropy; source coding; binary sequence; compression ratio; converse theorems; encoder; non-asymptotic coding; source coding; training sequence; universal data-compression algorithms; Binary sequences; Data compression; Encoding; Entropy; H infinity control; Jacobian matrices; Statistics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
  • Conference_Location
    Trondheim
  • Print_ISBN
    0-7803-2015-8
  • Type

    conf

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