arXiv · 2609.38243
Approximate Uniformity in Finite Convolution Models
Abstract
The problem of the uniform law being a sum of two independent distributions has been well studied. Here, we study the approximation of the uniform law to a sum of two distributions with fixed support, under the following discrepancies: the Manhattan distance, the Euclidean distance, the forward Kullback--Leibler divergence and the Wasserstein-one distance based on the line metric. The problem of membership of the uniform law in this model has been well studied. Explicit results are obtained in two models, one where one of the distributions is a Bernoulli and the other when both distributions have the same support, including one conjecture. Finally, we show an application of our reconstruction method to a recent conjecture about the coding capacity of an additive noise channel.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Nilava Metya, Satyaki Mukherjee. 2026-09-29. Approximate Uniformity in Finite Convolution Models. https://searcharxiv.com/abs/2609.38243
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.