QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ, Delft, The Netherlands.
Departamento de Análisis Matemático and Instituto de Matemática Interdisciplinar, Universidad Complutense de Madrid, 28040, Madrid, Spain.
Nat Commun. 2018 Mar 20;9(1):1149. doi: 10.1038/s41467-018-03428-0.
Most communication channels are subjected to noise. One of the goals of information theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted through the channel is as large as possible. The maximum rate at which reliable transmission is possible is called the capacity. If the channel does not keep memory of its past, the capacity is given by a simple optimization problem and can be efficiently computed. The situation of channels with memory is less clear. Here we show that for channels with memory the capacity cannot be computed to within precision 1/5. Our result holds even if we consider one of the simplest families of such channels-information-stable finite state machine channels-restrict the input and output of the channel to 4 and 1 bit respectively and allow 6 bits of memory.
大多数通信信道都会受到噪声的干扰。信息论的目标之一就是在信息传输过程中增加冗余,以便可靠地传输信息,并且通过信道传输的信息量尽可能大。可靠传输的最大速率称为容量。如果信道不保留其过去的记忆,则容量由一个简单的优化问题给出,并且可以有效地计算。具有记忆的信道的情况不太清楚。在这里,我们表明对于具有记忆的信道,其容量不能精确计算到 1/5。即使我们考虑具有记忆的信道的最简单的一类——信息稳定的有限状态机信道,将信道的输入和输出分别限制为 4 位和 1 位,并允许 6 位的记忆,我们的结果仍然成立。