Paper Info
Title
Novel bounds on the capacity of binary channels with deletions and substitutions
Abstract
We present novel bounds on the capacity of binary channels with independent and identically distributed deletions and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as in the system of interest, but the receiver is provided with (partial) genie-aided information on the deletion/substitution process. In the case of the deletion channel, that is, when no substitutions occur, the proposed upper bound improves the existing ones for most values of the deletion probability, while the proposed lower bound does not. On the other hand, when the channel model also includes substitution errors, both proposed bounds improve the existing ones, significantly narrowing the region to which the actual capacity can belong.
Year
DOI
Venue
2009
10.1109/ISIT.2009.5206015
ISIT
Keywords
Field
DocType
substitution error,deletion probability,channel model,deletion channel,binary channel,present novel bound,proposed bound,actual capacity,substitution process,auxiliary system,benchmark testing,upper bound,random processes,channel capacity,lower bound,data mining,independent and identically distributed
Process substitution,Discrete mathematics,Combinatorics,Upper and lower bounds,Communication channel,Capacity planning,Deletion channel,Independent and identically distributed random variables,Channel capacity,Mathematics,Binary number
Conference
Citations 
PageRank 
References 
9
1.22
8
Authors
2
Name
Order
Citations
PageRank
Dario Fertonani127320.07
Tolga M. Duman235147.37