Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes
Yin HH, Wong HW, Tahernia M, Lai RWF (2022)
Publication Type: Conference contribution
Publication year: 2022
Publisher: Institute of Electrical and Electronics Engineers Inc.
Book Volume: 2022-June
Pages Range: 1-6
Conference Proceedings Title: IEEE International Symposium on Information Theory - Proceedings
Event location: Espoo, FIN
ISBN: 9781665421591
DOI: 10.1109/ISIT50566.2022.9834710
Abstract
The theory of multichannel prefix codes aims to generalize the classical theory of prefix codes. Although single- two-channel prefix codes always have decoding trees, the same cannot be said when there are more than two channels. One question is of theoretical interest: Do there exist optimal codes that are not optimal prefix codes? Existing literature, focused on generalizing single-channel results, covered little about non-tree-decodable prefix codes since they have no single-channel counterparts. In this work, we study the fundamental reason behind the non-tree-decodability of prefix codes. By investigating the non-tree-decodable structure, we obtain a general sufficient condition on the channel alphabets for the existence of optimal tree-decodable codes that are not optimal prefix codes.
Authors with CRIS profile
Involved external institutions
China (CN)How to cite
APA:
Yin, H.H., Wong, H.W., Tahernia, M., & Lai, R.W.F. (2022). Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes. In IEEE International Symposium on Information Theory - Proceedings (pp. 1-6). Espoo, FIN: Institute of Electrical and Electronics Engineers Inc..
MLA:
Yin, Hoover H.F., et al. "Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes." Proceedings of the 2022 IEEE International Symposium on Information Theory, ISIT 2022, Espoo, FIN Institute of Electrical and Electronics Engineers Inc., 2022. 1-6.
BibTeX: Download