Abstract:
We call the alphabetic version of the AIFV-m code the alphabetic AIFV-m codes. This paper defines binary alphabetic AIFV-m codes and proposes an algorithm to design the o...Show MoreMetadata
Abstract:
We call the alphabetic version of the AIFV-m code the alphabetic AIFV-m codes. This paper defines binary alphabetic AIFV-m codes and proposes an algorithm to design the optimal binary alphabetic AIFV-m codes in terms of the minimum average codeword length for stationary memoryless sources. The proposed method is based on an iterative optimization algorithm and a dynamic programming algorithm.
Published in: 2020 IEEE Information Theory Workshop (ITW)
Date of Conference: 11-15 April 2021
Date Added to IEEE Xplore: 22 June 2021
ISBN Information:
Contents 