论文标题
基于随机编码的识别
Identification based on random coding
论文作者
论文摘要
AHLSWEDE和DUECK仅通过传输$ 1/c \ log \ log \ log m $ bits来识别$ m $消息中的高概率的可能性，其中$ c $是通道容量。众所周知，此标识可以基于错误纠正的代码。我们根据实现通道容量的随机代码提出了一个识别程序。然后，我们证明可以使用伪随机生成器来简化此过程。
Ahlswede and Dueck showed possibility to identify with high probability one out of $M$ messages by transmitting $1/C\log\log M$ bits only, where $C$ is the channel capacity. It is known that this identification can be based on error-correcting codes. We propose an identification procedure based on random codes that achieves channel capacity. Then we show that this procedure can be simplified using pseudo-random generators.
