AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost

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.