|| On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels
||Hoover H. F. Yin, Xishi Wang, Ka Hei Ng, The Chinese University of Hong Kong, Hong Kong SAR of China; Russell W. F. Lai, Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany; Lucien K. L. Ng, Jack P. K. Ma, The Chinese University of Hong Kong, Hong Kong SAR of China|
||D5-S1-T2: Variable-Length Codes
||Friday, 16 July, 22:00 - 22:20
||Friday, 16 July, 22:20 - 22:40
Zero-error single-channel source coding has been studied extensively over the past decades. Its natural multi-channel generalization is however seldom investigated. While the special case with multiple symmetric-alphabet channels was studied a decade ago, codes in such setting have no advantage over single-channel codes in data compression, making them worthless in most applications. With essentially no development since the last decade, in this paper, we break the stalemate by showing that it is possible to beat single-channel source codes in terms of compression assuming asymmetric-alphabet channels. We present the multi-channel analogs of several classical results in single-channel source coding, e.g., a multi-channel Huffman code is an optimal tree-decodable code. We also show evidences that finding an efficient construction of multi-channel Huffman codes may be hard. Nevertheless, we propose a construction whose redundancy is guaranteed to be no larger than that of an optimal single-channel source code.