On the capacity of a binary symmetric channel with deletions

A capacity C which is defined asymptotically for a generalized model of a discrete channel without memory is discussed. Random deletions due to loss of synchronization are considered. The upper and lower bounds of channel capacity with deletions are determined. A fundamental theory of channel coding with reference to this model is recommended. It is suggested that it is probable that C is an evaluator of the effective capacity, C', defined as the upper output bound of a transmission system without error.