Minimum MS. E. Gerber’s Lemma

DOI10.1109/TIT.2015.2479641MaRDI QIDQ2977102zbMATH OpenOpenAlexWikidataFDO

Authors Or Ordentlich, Ofer Shayevitz

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.00253

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Abstract: Mrs. Gerber's Lemma lower bounds the entropy at the output of a binary symmetric channel in terms of the entropy of the input process. In this paper, we lower bound the output entropy via a different measure of input uncertainty, pertaining to the minimum mean squared error (MMSE) prediction cost of the input process. We show that in many cases our bound is tighter than the one obtained from Mrs. Gerber's Lemma. As an application, we evaluate the bound for binary hidden Markov processes, and obtain new estimates for the entropy rate.

This page was built for publication: Minimum MS. E. Gerber’s Lemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977102)