论文标题
多通道最佳树可调代码并不总是最佳前缀代码
Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes
论文作者
论文摘要
多通道前缀代码的理论旨在概括前缀代码的经典理论。尽管单通道前缀和两个通道前缀代码总是具有解码树，但是当有两个以上的频道时，不能说同样的话。一个问题是理论上的兴趣：是否存在不是最佳的前缀代码的最佳树代码代码？现有的文献侧重于概括单通道结果，几乎没有涉及不可用的前缀代码，因为它们没有单渠道对应物。在这项工作中，我们研究了前缀代码非树质可调节性背后的基本原因。通过研究最简单的非树木定位结构，我们可以在通道字母上获得一般的足够条件，以实现不是最佳的不是最佳前缀代码的最佳树木定位代码。
The theory of multichannel prefix codes aims to generalize the classical theory of prefix codes. Although single- and 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 tree-decodable codes that are not optimal prefix codes? Existing literature, which 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 simplest 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.
