On the Capacity of the One-Bit Deletion and Duplication Channel
Information Theory
2012-10-10 v1 math.IT
Abstract
The one-bit deletion and duplication channel is investigated. An input to this channel consists of a block of bits which experiences either a deletion, or a duplication, or remains unchanged. For this channel a capacity expression is obtained in a certain asymptotic regime where the deletion and duplication probabilities tend to zero. As a corollary, we obtain an asymptotic expression for the capacity of the segmented deletion and duplication channel where the input now consists of several blocks and each block independently experiences either a deletion, or a duplication, or remains unchanged.
Keywords
Cite
@article{arxiv.1210.2704,
title = {On the Capacity of the One-Bit Deletion and Duplication Channel},
author = {Hamed Mirghasemi and Aslan Tchamkerten},
journal= {arXiv preprint arXiv:1210.2704},
year = {2012}
}
Comments
Allerton 2012