@inproceedings{5fe123ec023a4ce292b89beefcf513f6,
title = "Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes",
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.",
author = "Yin, {Hoover H.F.} and Wong, {Harry W.H.} and Mehrdad Tahernia and Lai, {Russell W.F.}",
note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; IEEE International Symposium on Information Theory, ISIT ; Conference date: 26-06-2022 Through 01-07-2022",
year = "2022",
doi = "10.1109/ISIT50566.2022.9834710",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "IEEE",
pages = "1--6",
booktitle = "2022 IEEE International Symposium on Information Theory, ISIT 2022",
address = "United States",
}