• DocumentCode
    1917925
  • Title

    Fast Construction of Nearly-Optimal Prefix Codes without Probability Sorting

  • Author

    Osorio, Roberto R. ; Gonzalez, P.

  • Author_Institution
    Dept. of Electron. & Syst., Univ. of A Coruna, A Coruña, Spain
  • fYear
    2012
  • fDate
    10-12 April 2012
  • Firstpage
    407
  • Lastpage
    407
  • Abstract
    In this abstract, an algorithm is proposed that achieves nearly-optimal coding without sorting the probabilities or building a tree of codes. The complexity is proportional to the maximum code length, making it especially attractive for large alphabets.
  • Keywords
    probability; tree codes; large alphabets; maximum code length; nearly-optimal prefix codes; probability sorting; tree codes; Binary trees; Checkpointing; Complexity theory; Data compression; Degradation; Hardware; Sorting; Huffman; prefix-codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Compression Conference (DCC), 2012
  • Conference_Location
    Snowbird, UT
  • ISSN
    1068-0314
  • Print_ISBN
    978-1-4673-0715-4
  • Type

    conf

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