Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICC.2009.5199553 | ICC |
Keywords | Field | DocType |
provable inequality,binary deletion channel,suitably-defined random process,deletion probability,manageable result,available lower bound,deletion channel capacity,proposed bound,infinite series,genie-aided information,closed-form expression,auxiliary memoryless channel,data mining,error probability,random process,upper bound,random processes,channel capacity,lower bound,transmitters,error correction,random variables | Combinatorics,Series (mathematics),Upper and lower bounds,Stochastic process,Communication channel,Capacity planning,Deletion channel,Channel capacity,Mathematics,Bounding overwatch | Conference |
ISSN | Citations | PageRank |
1550-3607 | 1 | 0.36 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dario Fertonani | 1 | 273 | 20.07 |
| Tolga M. Duman | 2 | 351 | 47.37 |