The confidence interval of entropy estimation through a noisy channel
Files
(Published version)
Date
2010
Authors
Ho, S.W.
Chan, T.H.L.
Grant, A.
Editors
Greferath, M.
Rosenthal, J.
Rosenthal, J.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
2010 IEEE Information Theory Workshop (ITW 2010), 2010 / Greferath, M., Rosenthal, J. (ed./s), pp.1-7
Statement of Responsibility
Conference Name
2010 IEEE Information Theory Workshop (ITW 2010) (30 Aug 2010 - 3 Sep 2010 : Dublin, Ireland)
Abstract
Suppose a stationary memoryless source is observed through a discrete memoryless channel. Determining analytical confidence intervals on the source entropy is known to be a difficult problem, even when the observation channel is noiseless. In this paper, we determine confidence intervals for estimation of source entropy over discrete memoryless channels with invertible transition matrices. A lower bound is given for the minimum number of samples required to guarantee a desired confidence interval. All these results do not require any prior knowledge of the source distribution, other than the alphabet size. When the alphabet size is countably infinite or unknown, we illustrate an inherent difficulty in estimating the source entropy.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material foradvertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists,or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.