Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications

We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information capacity using ideas from renewal theory, rather than focusing on the transmission capacity by analyzing the error probability of some randomly generated code using a combinatorial argument. Of course, the transmission and information capacities are equal, but our change of perspective allows for a much simpler analysis that gives more general theoretical results. We then apply these results to the binary deletion channel to improve existing lower bounds on its capacity. This work gives a new approach to lower bounding the asymptotic capacity of channels with i.i.d. deletions and duplications. We focus on channels with binary alphabets, although our results generalize in a natural way. Specifically, we consider channels that send an i.i.d. number (possibly zero) of copies of each transmitted bit. These channels...

• Type: Journal
• Year: 2010
• Where: TIT
• Authors: Adam Kirsch, Eleni Drinea
• Keywords: Education, Information, Lower Bounds, TIT 2010, Transmission Capacity