Kolmogorov Capacity with Overlap
The notion of δ-mutual information between non-stochastic uncertain variables is introduced as a generalization of Nair's non-stochastic information functional. Several properties of this new quantity are illustrated and used in a communication setting to show that the largest δ-mutual information between received and transmitted codewords over ϵ-noise channels equals the (ϵ,δ)-capacity. This notion of capacity generalizes the Kolmogorov ϵ-capacity to packing sets of overlap at most δ and is a variation of a previous definition proposed by one of the authors. Results are then extended to more general noise models, including non-stochastic, memoryless, and stationary channels. The presented theory admits the possibility of decoding errors, as in classical information theory, while retaining the worst-case, non-stochastic character of Kolmogorov's approach.
Authors
- Anshuka Rangi (ORCID: https://orcid.org/0000-0002-8462-7892)
- Massimo Franceschetti (ORCID: https://orcid.org/0000-0002-4057-8152)
Institutions
- University of California San Diego (US)
Publication Details
- Journal
- Entropy
- Published
- 2025-04-27
- DOI
- https://doi.org/10.3390/e27050472
- Primary Topic
- Advanced Bandit Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation