Tootfinder

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
Uri Erez, Or Ordentlich, Shlomo Shamai (Shitz)
https://arXiv.org/abs/2401.14710

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
It has been known for a long time that the mutual information between the input sequence and output of a binary symmetric channel (BSC) is upper bounded by the mutual information between the same input sequence and the output of a binary erasure channel (BEC) with the same capacity. Recently, Samorodintsky discovered that one may also lower bound the BSC mutual information in terms of the mutual information between the same input sequence and a more capable BEC. In this paper, we strengthen Sam…

This https://arxiv.org/abs/2402.04791 has been replaced.
link: https://scholar.google.com/scholar?q=a

Visibility in Hypercubes
A set $\mathcal{X}$ of vertices in a graph $G$ is a mutual-visibility set if any two vertices $u$ and $v$ in $\mathcal{X}$ "see" each other in $G$, that is, there exists a shortest $u$-$v$ path in $G$ that contains no elements of $\mathcal{X}$ as internal vertices. The mutual-visibility number of a graph $G$, denoted $μ(G)$, is the largest size of a mutual-visibility set in $G$. This notion was introduced by Di Stefano and studied for various product graphs, particularly hypercubes, motivated …

Welt: Ukraine withdrew from the negotiation process with Russia in 2022 due to Russia's new demands: https://benborges.xyz/2024/04/27/welt-ukraine-withdrew.html

Kid K is playing a multiplayer shooter with a friend F
K: I just killed a kid
F: what? Did you say you killed Keon [a mutual friend]
K: no I only do that on Tuesdays

Rethinking Mutual Information for Language Conditioned Skill Discovery on Imitation Learning
Zhaoxun Ju, Chao Yang, Hongbo Wang, Yu Qiao, Fuchun Sun
https://arxiv.org/abs/2402.17511

Rethinking Mutual Information for Language Conditioned Skill Discovery on Imitation Learning
Language-conditioned robot behavior plays a vital role in executing complex tasks by associating human commands or instructions with perception and actions. The ability to compose long-horizon tasks based on unconstrained language instructions necessitates the acquisition of a diverse set of general-purpose skills. However, acquiring inherent primitive skills in a coupled and long-horizon environment without external rewards or human supervision presents significant challenges. In this paper, w…

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
Uri Erez, Or Ordentlich, Shlomo Shamai (Shitz)
https://arXiv.org/abs/2401.14710

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
It has been known for a long time that the mutual information between the input sequence and output of a binary symmetric channel (BSC) is upper bounded by the mutual information between the same input sequence and the output of a binary erasure channel (BEC) with the same capacity. Recently, Samorodintsky discovered that one may also lower bound the BSC mutual information in terms of the mutual information between the same input sequence and a more capable BEC. In this paper, we strengthen Sam…

This https://arxiv.org/abs/2402.04791 has been replaced.
link: https://scholar.google.com/scholar?q=a

Visibility in Hypercubes
A set $\mathcal{X}$ of vertices in a graph $G$ is a mutual-visibility set if any two vertices $u$ and $v$ in $\mathcal{X}$ "see" each other in $G$, that is, there exists a shortest $u$-$v$ path in $G$ that contains no elements of $\mathcal{X}$ as internal vertices. The mutual-visibility number of a graph $G$, denoted $μ(G)$, is the largest size of a mutual-visibility set in $G$. This notion was introduced by Di Stefano and studied for various product graphs, particularly hypercubes, motivated …

Kid K is playing a multiplayer shooter with a friend F
K: I just killed a kid
F: what? Did you say you killed Keon [a mutual friend]
K: no I only do that on Tuesdays

Mitch #McConnell tries to cling to power by bending the knee to #Trump

Mitch McConnell tries to cling to power by bending the knee to Trump
House Minority Leader Mitch McConnell and Donald Trump have a long-standing mutual loathing, but that apparently won’t stop McConnell from bowing to Trump. The two men’s political teams have ...

Mutual Information Optimization for SIM-Based Holographic MIMO Systems
Nemanja Stefan Perovi\'c, Le-Nam Tran
https://arxiv.org/abs/2403.18307 https://<…

Mutual Information Optimization for SIM-Based Holographic MIMO Systems
In the context of emerging stacked intelligent metasurface (SIM)-based holographic MIMO (HMIMO) systems, a fundamental problem is to study the mutual information (MI) between transmitted and received signals to establish their capacity. However, direct optimization or analytical evaluation of the MI, particularly for discrete signaling, is often intractable. To address this challenge, we adopt the channel cutoff rate (CR) as an alternative optimization metric for the MI maximization. In this re…