AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost
Ken-ichi Iwata, Kengo Hashimoto, Takahiro Wakayama, University of Fukui, Japan; Hirosuke Yamamoto, The University of Tokyo, Japan
Session:
Lossless Source Coding
Track:
10: Source Coding and Data Compression
Location:
Omikron II
Presentation Time:
Mon, 8 Jul, 10:05 - 10:25
Session Chair:
Tamas Linder, Queen's University
Abstract
This paper considers noiseless source codes for the unequal cost of bits, a generalization of the cost measured by the codeword length of binary source codes. We generalize AIFV (Almost Instantaneous Fixed-to-Variable length) codes to the case of unequal bit costs taking positive integers.