Generalization of Mrs. Gerber's Lemma release_rbsuwzirfzhqtmrftwlpvsxc6u

by Fan Cheng

Released as a article .



Mrs. Gerber's Lemma (MGL) hinges on the convexity of $H(p*H^{-1}(u))$, where $H(u)$ is the binary entropy function. In this work, we prove that $H(p*f(u))$ is convex in $u$ for every $p\in [0,1]$ provided $H(f(u))$ is convex in $u$, where $f(u) : (a, b) \to [0, \frac12]$. Moreover, our result subsumes MGL and simplifies the original proof. We show that the generalized MGL can be applied in binary broadcast channel to simplify some discussion.
In text/plain format

Archived Files and Locations

application/pdf  94.3 kB
file_3abcyn5vmneefi65n645oq5raq (webarchive) (repository)
Read Archived PDF
Type  article
Stage   submitted
Date   2014-09-11
Version   v2
Language   en ?
arXiv  1409.1668v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 25acc750-5d05-4f0e-8044-86da67f2b503