Loading [a11y]/accessibility-menu.js
Directly Lower Bounding the Information Capacity for Channels with I.I.D. Deletions and Duplications | IEEE Conference Publication | IEEE Xplore

Directly Lower Bounding the Information Capacity for Channels with I.I.D. Deletions and Duplications


Abstract:

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 info...Show More

Abstract:

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.
Date of Conference: 24-29 June 2007
Date Added to IEEE Xplore: 09 July 2008
ISBN Information:

ISSN Information:

Conference Location: Nice, France

Contact IEEE to Subscribe

References

References is not available for this document.