Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel

Francisco Pernice, Berivan Isik, Tsachy Weissman

Abstract: We consider the mutual information between a uniformly-random input and the corresponding output through the deletion channel. We prove an upper bound that’s within approximately 0.1 of the best-known lower bounds for all values of the deletion probability $d$ , and much closer for small and large $d$ . We give simulation results which suggest that our upper bound is within 0.05 of the exact value for all $d$ , and within 0.01 for $d>0.75$ . Despite our upper bounds, based on simulations, we conjecture that the mutual information is positive for all deletion probabilities less than 1. Our results imply impossibility results for the (equivalent) problem of compression of i.i.d. sources correlated via the deletion channel, a relevant model for DNA storage.