On the Zero-Error Capacity Threshold for Deletion Channels

Details On the Zero-Error Capacity Threshold for Deletion Channels On the Zero-Error Capacity Threshold for Deletion Channels

2011-01-31

arxiv.org/abs/1102.0040v1

Computer Science

Information Theory

9 pages, 0 figures

Scientific paper

We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook ${\cal C}$ consisting of strings of $n$ bits, and our model of the channel corresponds to an adversary who may delete up to $pn$ of these bits for a constant $p$. Our goal is to decode correctly without error regardless of the actions of the adversary. We consider what values of $p$ allow non-zero capacity in this setting. We suggest multiple approaches, one of which makes use of the natural connection between this problem and the problem of finding the expected length of the longest common subsequence of two random sequences.

Affiliated with

Also associated with

No associations

Rating

On the Zero-Error Capacity Threshold for Deletion Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Zero-Error Capacity Threshold for Deletion Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Zero-Error Capacity Threshold for Deletion Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499837