• DocumentCode
    2298971
  • Title

    An Efficient Implementation of Adaptive Prefix Coding

  • Author

    Nekrich, Yakov

  • Author_Institution
    Dept. of Comput. Sci., Bonn Univ., Bonn
  • fYear
    2007
  • fDate
    27-29 March 2007
  • Firstpage
    396
  • Lastpage
    396
  • Abstract
    The goal of the prefix coding is to assign codewords to elements of the input alphabet A, so that no codeword is a prefix of another one, and the total length of the encoded message S is minimized. In the case of static prefix coding, symbol frequencies are known in advance. In the case of adaptive (or dynamic) prefix coding, every symbol Si is encoded before the next symbol Si+1 is read.
  • Keywords
    adaptive codes; encoding; adaptive prefix coding; codeword assignment; message encoding; symbol frequency; Adaptive algorithm; Adaptive coding; Arithmetic; Computer science; Costs; Decoding; Frequency; Information theory; Testing; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Compression Conference, 2007. DCC '07
  • Conference_Location
    Snowbird, UT
  • ISSN
    1068-0314
  • Print_ISBN
    0-7695-2791-4
  • Type

    conf

  • DOI
    10.1109/DCC.2007.12
  • Filename
    4148797
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2298971