TY - GEN
T1 - Upper bounding the deletion channel capacity by auxiliary memoryless channels
AU - Fertonani, Dario
AU - Duman, Tolga M.
PY - 2009/11/19
Y1 - 2009/11/19
N2 - We present two upper bounds on the capacity of the binary deletion channel. Both bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined random processes. Since the closed-form expressions of the proposed bounds involve infinite series, we also introduce provable inequalities that lead to more manageable results. For most values of the deletion probability, these bounds improve the existing ones and significantly narrow the gap with the available lower bounds.
AB - We present two upper bounds on the capacity of the binary deletion channel. Both bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined random processes. Since the closed-form expressions of the proposed bounds involve infinite series, we also introduce provable inequalities that lead to more manageable results. For most values of the deletion probability, these bounds improve the existing ones and significantly narrow the gap with the available lower bounds.
UR - http://www.scopus.com/inward/record.url?scp=70449473150&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449473150&partnerID=8YFLogxK
U2 - 10.1109/ICC.2009.5199553
DO - 10.1109/ICC.2009.5199553
M3 - Conference contribution
AN - SCOPUS:70449473150
SN - 9781424434350
T3 - IEEE International Conference on Communications
BT - Proceedings - 2009 IEEE International Conference on Communications, ICC 2009
T2 - 2009 IEEE International Conference on Communications, ICC 2009
Y2 - 14 June 2009 through 18 June 2009
ER -