Search arXivSearch

arXiv · 2607.08599

New sharp inequalities involving non-relative, relative and cross informational functionals with some remarkable minimizers of generalized Gaussian and Beta types

Abstract

Several new and sharp informational inequalities are derived as a byproduct of Stam-like and moment-entropy-like inequalities in the relative framework and a recently established inequality mixing the Rényi entropy, the Rényi divergence and the Rényi cross entropy of suitable probability density functions. More precisely, we obtain a Stam-like inequality connecting the Rényi entropy power, the recently introduced scaling-invariant relative Fisher information and the Rényi cross entropy. Furthermore, we derive an inequality involving only Fisher-like informational measures and another inequality involving only moment-like functionals of non-relative, relative and cross types, respectively. All the inequalities are sharp. The minimizers of the Stam-like inequality are, in certain cases, pairs of Gaussian or stretched Gaussian probability densities; in contrast, each minimizer of the moment-like inequality is the probability density of the generalized Beta distribution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Razvan Gabriel Iagar, David Puertas-Centeno. 2026-07-09. New sharp inequalities involving non-relative, relative and cross informational functionals with some remarkable minimizers of generalized Gaussian and Beta types. https://arxiv.org/abs/2607.08599

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT