8 papers · 1 filter
An Information Theoretic Treatment of Yager's Probability Distribution Negation
Roberto Bruno, Ugo Vaccaro
In the seminal paper (Yager 2015), Yager defined the negation of a probability distribution , as the distribution $\overline{\mathbf{p}} = (\overline{p}…
The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
Roberto Bruno, Ugo Vaccaro
We prove that Sharma-Mittal entropy is a subadditive and supermodular function on the lattice of all -dimensional probability distributions, ordered according to the partial ord…
A Finite-Sample Strong Converse for Binary Hypothesis Testing via (Reverse) Rényi Divergence
Roberto Bruno, Adrien Vandenbroucque, Amedeo Roberto Esposito
This work investigates binary hypothesis testing between and in the finite-sample regime under asymmetric error constraints. By employing the ``reverse"…
Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
Roberto Bruno, Roberto De Prisco, Ugo Vaccaro
In this paper, we consider the problem of constructing optimal average-length binary codes under the constraint that each codeword must contain at most ones, where is a giv…
Old and New Results on Alphabetic Codes
Roberto Bruno, Roberto De Prisco, Ugo Vaccaro
This comprehensive survey examines the field of alphabetic codes, tracing their development from the 1960s to the present day. We explore classical alphabetic codes and their varia…
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
Roberto Bruno, Roberto De Prisco, Alfredo De Santis +1
Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions. In this paper, we desi…