TY - GEN
T1 - On the capacity of the one-bit deletion and duplication channel
AU - Mirghasemi, Hamed
AU - Tchamkerten, Aslan
PY - 2012/12/1
Y1 - 2012/12/1
N2 - The one-bit deletion and duplication channel is investigated. An input to this channel consists of a block of l ≥ 1 bits which experiences a deletion with probability p, a duplication with probability q, and remains unchanged with probability 1 - p - q. For this channel a capacity expression is obtained in the asymptotic regime where p + q = o(l/logl). As a corollary, we obtain an asymptotic expression for the capacity of the so called '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.
AB - The one-bit deletion and duplication channel is investigated. An input to this channel consists of a block of l ≥ 1 bits which experiences a deletion with probability p, a duplication with probability q, and remains unchanged with probability 1 - p - q. For this channel a capacity expression is obtained in the asymptotic regime where p + q = o(l/logl). As a corollary, we obtain an asymptotic expression for the capacity of the so called '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.
U2 - 10.1109/Allerton.2012.6483212
DO - 10.1109/Allerton.2012.6483212
M3 - Conference contribution
AN - SCOPUS:84875744878
SN - 9781467345385
T3 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
SP - 152
EP - 159
BT - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
T2 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Y2 - 1 October 2012 through 5 October 2012
ER -