论文部分内容阅读
本文利用“信息门限判决译码法”给出了BSC与BEC及Z-信道三种简单无记忆信道的信息门限译码方案并分别讨论了它们的误差界问题,得到了它们的误差概率上界按指数律趋于零的结果。与Wozencraft和Gallager的结果对比可以看出,用这种方法,无记忆信道的误差界理论就变得颇为简单而且对BSC取消了Wozencraft对速率R~t的限制,对BEC得到了与Gallager的极大似然译码法的误差上界相同的指数公式。
In this paper, the information threshold decoding scheme of three kinds of simple memoryless channels of BSC, BEC and Z-channel is given by “information threshold decision decoding method” and their error bounds are discussed respectively. The upper bounds of their error probabilities The result of exponential law tends to zero. Compared with the results of Wozencraft and Gallager, we can see that in this way, the error boundless theory of memoryless channel becomes quite simple and cancels Wozencraft’s rate R ~ t limitation for BSC, Maximum likelihood decoding method of the upper bound of the same index formula.