• DocumentCode
    3248895
  • Title

    Non-asymptotic bounds on fixed length source coding for Markov chains

  • Author

    Hayashi, Mariko ; Watanabe, Shigetaka

  • Author_Institution
    Grad. Sch. of Math., Nagoya Univ., Nagoya, Japan
  • fYear
    2013
  • fDate
    2-4 Oct. 2013
  • Firstpage
    875
  • Lastpage
    882
  • Abstract
    In this paper, we derive non-asymptotic bounds on the fixed length source coding with/without side-information at the decoder. Our bounds are efficiently computable in the sense that the computational complexity does not depend on the block length, and are also asymptotically optimal in the sense of the large deviation and/or the moderate deviation.
  • Keywords
    Markov processes; block codes; computational complexity; source coding; Markov chains; block length; computational complexity; fixed length source coding; non asymptotic bounds; Computational complexity; Decoding; Educational institutions; Error probability; Markov processes; Source coding; Tin;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on
  • Conference_Location
    Monticello, IL
  • Print_ISBN
    978-1-4799-3409-6
  • Type

    conf

  • DOI
    10.1109/Allerton.2013.6736617
  • Filename
    6736617
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3248895