Â鶹´«Ã½Ó³»­

°Õ³ó±ðÌý deletion Ìý channel Ìýis the simplest point-to-point communicationÌý channel Ìýthat models lack of synchronization. Despite significant effort, little is known about its capacity, and even less about optimal coding schemes. In this paper we initiate a new systematic approach to this problem, by demonstrating that capacity can be computed in a series expansion forÌý small Ìý deletion Ìý probability .We compute two leading terms of this expansion, and show that capacity is achieved, up to this order, by i.i.d. uniform random distribution of the input. We think that this strategy can be useful in a number of capacity calculations.