34 citations · 121 across the 14 of their papers we have counts for
4 papers · 1 filter
On Universal D-Semifaithful Coding for Memoryless Sources with Infinite Alphabets
Jorge F. Silva, Pablo Piantanida
The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding) for stationary and memoryless sources on countably infinite alphabets…
Finite-Length Bounds on Hypothesis Testing Subject to Vanishing Type I Error Restrictions
Sebastian Espinosa, Jorge F. Silva, Pablo Piantanida
A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) er…
Shannon Entropy Estimation in -Alphabets from Convergence Results
Jorge F. Silva
The problem of Shannon entropy estimation in countable infinite alphabets is addressed from the study and use of convergence results of the entropy functional, which is known to be…
Universal Weak Variable-Length Source Coding on Countable Infinite Alphabets
Jorge F. Silva, Pablo Piantanida
Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to th…