IT ] 2 A pr 2 01 0 1 A new bound for the capacity of the deletion channel with high deletion probabilities

@inproceedings{Dalai2010IT2,
  title={IT ] 2 A pr 2 01 0 1 A new bound for the capacity of the deletion channel with high deletion probabilities},
  author={Marco Dalai},
  year={2010}
}
Let C(d) be the capacity of the deletion channel with deletion probab ility d. It was recently proved by Fertonani and Duman that lim sup d→1 C(d)/(1−d) ≤ 0.49. In this paper, it is prove that limd→1 C(d)/(1−d) = infd C(d)/(1− d). This result suggests that C(d) may be a convex function of d and it allows to improve the constant 0.49 above to 0.413 using an… CONTINUE READING