Tootfinder

The Shannon-McMillan-Breiman theorem of random dynamical systems for amenable group actions
Yuan Lian, Bin Zhu
https://arxiv.org/abs/2506.01805 https://

The Shannon-McMillan-Breiman theorem of random dynamical systems for amenable group actions
The Shannon-McMillan-Breiman theorem is one of the most important results in information theory, which can describe the random ergodic process, and its proof uses the famous Birkhoff ergodic theorem, so it can be seen that it plays a crucial role in ergodic theory. In this paper, the Shannon-McMillan-Breiman theorem in the random dynamical systems is proved from the perspective of an amenable group action, which provides a boost for the development of entropy theory in the random dynamical syst…

Patterns and Dynamics of Netflix TV Show Popularity
Nahyeon Lee, Jongsoo Lim, Hyeong-Chai Jeong
https://arxiv.org/abs/2507.01620 https://

Patterns and Dynamics of Netflix TV Show Popularity
We investigate the global dynamics of media consumption by analyzing daily top-ranked Netflix TV shows across 71 countries over a span of 822 days. Using an information-theoretic framework, we quantify diversity, similarity, and directional influence in consumption trends through three core measures, Shannon entropy, mutual information, and Kullback-Leibler (KL) divergence. Entropy reveals that content diversity varies by region, with North America and Europe exhibiting highly dynamic viewing p…

Information Theoretic Analysis of a Dual-Band MIMO Cellphone Antenna with ANSYS HFSS SBR
Volodymyr Shyianov, Bamelak Tadele, Vladimir I. Okhmatovski, Amine Mezghani
https://arxiv.org/abs/2507.14704

Information Theoretic Analysis of a Dual-Band MIMO Cellphone Antenna with ANSYS HFSS SBR+
Historically, the design of antenna arrays has evolved separately from Shannon theory. Shannon theory adopts a probabilistic approach in the design of communication systems, while antenna design approaches have relied on the deterministic Maxwell theory alone. In this paper, we investigate an information-theoretic analysis approach which we apply to evaluate the design of a dual-band, dual-polarized multiple-input multiple-output (MIMO) array on a cellphone. To this end, we use ANSYS HFSS, a co…

Bounds of Shannon entropy and Extropy and their application in exploring the extreme value behavior of a large set of data
Konstantinos Zografos
https://arxiv.org/abs/2507.13656

Bounds of Shannon entropy and Extropy and their application in exploring the extreme value behavior of a large set of data
This paper derives bounds for two omnipresent information theoretic measures, the Shannon entropy and its complementary dual, the extropy. Based on a large size data set from a logconcave model, the said bounds are obtained for the entropy and the extropy of the distribution of the largest order statistic and the respective normalized sequence, in the extreme value theory setting. A characterization of the exponential distribution is provided as the model that maximizes the Shannon entropy and …

Additivity of quantum relative entropies as a single-copy criterion
Salman Beigi, Roberto Rubboli, Marco Tomamichel
https://arxiv.org/abs/2507.05696 https:…

Additivity of quantum relative entropies as a single-copy criterion
The fundamental goal of information theory is to characterize complex operational tasks using efficiently computable information quantities, Shannon's capacity formula being the prime example of this. However, many tasks in quantum information can only be characterized by regularized entropic measures that are often not known to be computable and for which efficient approximations are scarce. It is thus of fundamental importance to understand when regularization is not needed, opening the door …

The Relationship between Cognition and Computation: "Global-first" Cognition versus Local-first Computation
Lin Chen
https://arxiv.org/abs/2506.17970

The Relationship between Cognition and Computation: "Global-first" Cognition versus Local-first Computation
What fundamental research questions are essential for advancing toward brain-like AI or AGI (Artificial General Intelligence) capable of performing any intellectual task a human can? Should it be something like the Turing machine (1936), which answers the question "What is computation?" and lays the foundation for the entire field of computer science? Or should it be something like Shannon's mathematical theory of communication (1948), which answers the question "What is information?" and forms…

End-to-End Learning of Probabilistic Constellation Shaping through Importance Sampling
Shrinivas Chimmalgi, Laurent Schmalen, Vahid Aref
https://arxiv.org/abs/2506.16098

End-to-End Learning of Probabilistic Constellation Shaping through Importance Sampling
Probabilistic constellation shaping enables easy rate adaption and has been proven to reduce the gap to Shannon capacity. Constellation point probabilities are optimized to maximize either the mutual information or the bit-wise mutual information. The optimization problem is however challenging even for simple channel models. While autoencoder-based machine learning has been applied successfully to solve this problem [1], it requires manual computation of additional terms for the gradient which…

Capacity Based Design of Slot Array Antennas
Volodymyr Shyianov, Bamelak Tadele, Vladimir I. Okhmatovski, Faouzi Bellili, Amine Mezghani
https://arxiv.org/abs/2506.17845

Capacity Based Design of Slot Array Antennas
Historically, the design of antenna arrays has evolved separately from Shannon theory. Shannon theory adopts a probabilistic approach in the design of communication systems, while antenna design approaches have relied on deterministic Maxwell theory alone. In this paper, we introduce a new approach to the design of antenna arrays based on information theoretic metrics. To this end, we develop a statistical model suitable for the numerical optimization of antenna systems. The model is utilized t…

Perfect Secrecy in the Wild: A Characterization
Costas Cavounidis, Massimiliano Furlan, Alkis Georgiadis-Harris
https://arxiv.org/abs/2506.12416 https://…

Perfect Secrecy in the Wild: A Characterization
Alice wishes to reveal the state $X$ to Bob, if he knows some other information $Y$ also known to her. If Bob does not, she wishes to reveal nothing about $X$ at all. When can Alice accomplish this? We provide a simple necessary and sufficient condition on the joint distribution of $X$ and $Y$. Shannon's result on the perfect secrecy of the one-time pad follows as a special case.

Round-Preserving Asymptotic Compression of Prior-Free Interactive Protocols
Gurleen Padda, Dave Touchette
https://arxiv.org/abs/2507.13464 https://

Round-Preserving Asymptotic Compression of Prior-Free Interactive Protocols
There is a close relationship between the communication complexity and information complexity of communication problems, as demonstrated by results such as Shannon's noiseless source coding theorem, and the Slepian-Wolf theorem. Here, we study this relationship in the prior-free and interactive setting, where we provide an alternate proof for the result of Braverman [SIAM Review, vol. 59, no. 4, 2017], that the amortized communication complexity of simulating a prior-free interactive communicat…

Entropy measures as indicators of connectivity paths in the human brain
Ania Mesa-Rodr\'iguez, Ernesto Estevez-Rams, Holger Kantz
https://arxiv.org/abs/2507.04442

Entropy measures as indicators of connectivity paths in the human brain
How does the information flow between different brain regions during various stimuli? This is the question we aim to address by studying complex cognitive paradigms in terms of Information Theory. To assess creativity and the emergence of patterns from a Shannon perspective, we applied a range of tools, including Entropy Density, Effective Measure Complexity, and the Lempel-Ziv distance. These entropic tools enable the detection of both linear and non-linear dynamics without relying on pre-esta…

Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Metrization of powers of the Jensen-Shannon divergence
Kazuki Okamura