论文标题
通过预定的词典实现正率
Achieving positive rates with predetermined dictionaries
论文作者
论文摘要
在本文的第一部分中，我们考虑不一定是固定的二进制输入通道，并显示使用约束的代码在预定词典中可以实现正率。我们使用吉尔伯特·瓦尔沙莫夫（Gilbert-Varshamov）的论点来获得达到所需的速率实现代码。接下来，我们研究具有任意字母的渠道的相应问题，并使用冲突设定的解码表明，如果字典包含在不错的集合中，则可以实现正率。
In the first part of the paper we consider binary input channels that are not necessarily stationary and show how positive rates can be achieved using codes constrained to be within predetermined dictionaries. We use a Gilbert-Varshamov-like argument to obtain the desired rate achieving codes. Next we study the corresponding problem for channels with arbitrary alphabets and use conflict-set decoding to show that if the dictionaries are contained within nice sets, then positive rates are achievable.
