most citedOld and New Results on Alphabetic Codes

3 citations · 3 across the 1 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2026

Constrained Maximum Entropy Contiguous Aggregations

Roberto Bruno, Ugo Vaccaro

Given a probability distribution and an integer , a contiguous aggregation of is a probability distribution such…

cs.IT2026

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}…

cs.IT2026

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"…

cs.IT20253 cited

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…

cs.IT2025

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…