Directly lower bounding the information capacity for channels with IID 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.


Published in:
2007 Ieee International Symposium On Information Theory Proceedings, Vols 1-7, 1731-1735
Presented at:
IEEE International Symposium on Information Theory, Nice, FRANCE, Jun 24-29, 2007
Year:
2007
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-1397-3
Laboratories:




 Record created 2012-07-04, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)