AI & ML
Revisiting Shannon's Source Coding Theorem with Distributional Uncertainty under the Nonlinear Expectation Theory
arXiv math.IT0 views
arXiv:2608.16543v2 Announce Type: replace Abstract: In classical information theory, a source is modeled by a single, precisely known probability distribution. However, in the increasingly complex communication networks full of unanticipated, nonstationary, and heterogeneous random events, the assumption of precise and well-defined probability distributions to describe random variables appears somewhat idealized. Therefore, it is important to characterize the uncertainty of distributions of source messages, subject to relaxing the assumption of deterministic probability models for analyzing information sources in information theory. Based on the nonlinear expectation theory, a novel axiomatical system that extends classical probability theory, this paper investigates the information sources whose distributions themselves are uncertain, and refers to them as uncertain-distribution sources. We generalize the fundamental concept information entropy to nonlinear information entropy, which describes the measurement of the amount of information contained in a uncertain-distribution source. By using the strong law of large numbers under sublinear expectation, we establish a nonlinear source coding theorem, which not only shows that the nonlinear information entropy is the upper bound for the infimum of achievable coding rate of uncertain-distribution sources under the maximum error probability criterion, but also determines a cluster point of the coding rate of uncertain-distribution sources under the minimum error probability criterion. Our findings reveal that the introduction of nonlinear expectation theory allows for a more comprehensive understanding of information sources.
Source:https://arxiv.org/abs/2608.16543PreviousLinear-time erasure recovery for quantum expander codesNextQuantum Information Transmission Over Quantum Relay Channels
Related posts
Meta Quest Promo Codes and Coupons for November 2026
0Wired
BullMQ in NestJS: Retries, Idempotency and Dead-Letter Queues
0dev.to
80.6% at Chores, 12% at Real Work: AI's Benchmark Week
0dev.to
Efficient estimation of regression models for recurrent events in presence of terminal events
0arXiv stat.CO
Local Whittle estimation for distributional time series: A regularization framework in Bayes Hilbert space
0arXiv stat.CO
Inventory and Assortment Optimization under General Choice: A Unified Approximation Framework
0arXiv stat.CO