This paper considers a binary channel with deletions. We derive two close form upper bound on the capacity of binary deletion channel. The first upper bound is based on computing the capacity of an auxiliary channel and we show how the capacity of auxiliary channel is the upper bound of the binary deletion channel. Our main idea for the second bound is based on computing the mutual information between the sent bits and the received bits in binary deletion channel. We approximate the exact mutual information and we give a close form expression. All bounds utilize first-order Markov process for the channel input. The second proposed upper bound improves the best upper bound [6,11] up to 0.1.

翻译：本文审议带有删除内容的二进制通道。 我们从二进制删除频道的能力上获取两个近形的上限。 第一个上限是基于计算辅助频道的能力, 我们显示辅助频道的能力是二进制删除频道的上限。 我们的第二个约束的主要想法是基于计算发送的位数和二进制删除频道中接收的位数之间的相互信息。 我们比较了准确的相互信息, 我们给出了一个近似的表达式。 所有边框都使用第一级 Markov 程序进行频道输入。 第二个拟议上限将最好的上限 [6, 11] 提高到 0.1 。