• DocumentCode
    640191
  • Title

    Almost instantaneous FV codes

  • Author

    Yamamoto, Hiroshi ; Xiaofeng Wei

  • Author_Institution
    Dept. of Complexity Sci. & Eng., Univ. of Tokyo, Kashiwa, Japan
  • fYear
    2013
  • fDate
    7-12 July 2013
  • Firstpage
    1759
  • Lastpage
    1763
  • Abstract
    In this paper, K-ary almost instantaneous fixed-to-variable-length (AIFV) codes are proposed for K ≥ 3, and it is shown that the K-ary AIFV codes using K - 1 code trees can attain better compression than K-ary Huffman codes for stationary memoryless sources. Furthermore, it is also shown that binary relaxed AIFV codes with two code trees can beat binary Huffman codes.
  • Keywords
    binary codes; trees (mathematics); variable length codes; Huffman codes; K-1 code trees; K-ary AIFV codes; almost instantaneous fixed-to-variable-length codes; binary relaxed codes; stationary memoryless sources; Complexity theory; Cost function; Decoding; Delays; Encoding; Manganese;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
  • Conference_Location
    Istanbul
  • ISSN
    2157-8095
  • Type

    conf

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