Strongly Convex Divergences.

We consider a sub-class of the -divergences satisfying a stronger convexity property, which we refer to as strongly convex, or κ-convex divergences. We derive new and old relationships, based on convexity arguments, between popular -divergences.

Entropy and Information Inequalities.

Entropy and information inequalities are vitally important in many areas of mathematics and engineering [...

Analysis of Heat Dissipation and Reliability in Information Erasure: A Gaussian Mixture Approach.

This article analyzes the effect of imperfections in physically realizable memory. Motivated by the realization of a bit as a Brownian particle within a double well potential, we investigate the energetics of an erasure protocol under a Gaussian mixture model. We obtain sharp quantitative entropy bounds that not only give rigorous justification for heuristics utilized in prior works, but also provide a guide toward the minimal scale at which an erasure protocol can be performed.