• DocumentCode
    3050614
  • Title

    Minimum description length prediction of next symbol

  • Author

    Krichevskii, Rafail E.

  • Author_Institution
    Sobolev Inst. of Math., Novosibirsk, Russia
  • fYear
    1997
  • fDate
    29 Jun-4 Jul 1997
  • Firstpage
    314
  • Abstract
    The paper shows that the known “add-half” rule is not asymptotically optimal for minimal description length prediction of the (n+1)-st symbol after a sequence of n symbols, whereas the “add-β0”,β0=0.50922 rule is. We also estimate from below the performance of arbitrary, not just “add-something” prediction
  • Keywords
    prediction theory; source coding; add-β0 rule; add-half rule; minimum description length prediction; next symbol; performance estimation; source coding; symbol sequence; universal encoding; Encoding; Entropy; Mathematics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
  • Conference_Location
    Ulm
  • Print_ISBN
    0-7803-3956-8
  • Type

    conf

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