Upper bounds on the Rate of Uniformly-Random Codes for the Deletion Channel

Berivan Isik, Francisco Pernice, Tsachy Weissman

We consider the maximum coding rate achievable by uniformly-random codes for the deletion channel. We prove an upper bound that's within 0.1 of the best known lower bounds for all…