TY - GEN
T1 - An improvement of the deletion channel capacity upper bound
AU - Rahmati, Mojtaba
AU - Duman, Tolga M.
PY - 2013
Y1 - 2013
N2 - In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion channels by 'fragmenting' the input sequence where different subsequences travel through different channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. Considering a random fragmentation processes applied to binary deletion channels, we prove an inequality relation among the capacities of the original binary deletion channel and the introduced binary deletion subchannels. This inequality enables us to provide an improved upper bound on the capacity of the i.i.d. deletion channels, i.e., C(d) ≤ 0.4143(1 - d) for d ≥ 0.65. We also consider a deterministic fragmentation process suitable for the study of non-binary deletion channels which results in improved capacity upper bounds.
AB - In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion channels by 'fragmenting' the input sequence where different subsequences travel through different channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. Considering a random fragmentation processes applied to binary deletion channels, we prove an inequality relation among the capacities of the original binary deletion channel and the introduced binary deletion subchannels. This inequality enables us to provide an improved upper bound on the capacity of the i.i.d. deletion channels, i.e., C(d) ≤ 0.4143(1 - d) for d ≥ 0.65. We also consider a deterministic fragmentation process suitable for the study of non-binary deletion channels which results in improved capacity upper bounds.
UR - http://www.scopus.com/inward/record.url?scp=84897707653&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84897707653&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2013.6736665
DO - 10.1109/Allerton.2013.6736665
M3 - Conference contribution
AN - SCOPUS:84897707653
SN - 9781479934096
T3 - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
SP - 1221
EP - 1225
BT - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
PB - IEEE Computer Society
T2 - 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
Y2 - 2 October 2013 through 4 October 2013
ER -