Small-sample distribution estimation over sticky channels

Authors:
Farzad Famoud;Olgica Milenkovic;Narayana Prasad Santhanam
Affiliations:
Department of Electrical & Computer Engineering, UIUC, Urbana, IL;Department of Electrical & Computer Engineering, UIUC, Urbana, IL;Department of Electrical Engineering, University of Hawaii, Honolulu, HI
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 3
Cited 0

Always Good Turing: Asymptotically Optimal Probability Estimation

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Maximum Likelihood Set for Estimating a Probability Mass Function

Neural Computation
Capacity Bounds for Sticky Channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of estimating unknown source distributions based on a small number of possibly erroneous observations. Errors are modeled as arising from sticky channels, which introduce repetitions of transmitted source symbols. Both the problems of estimating the distribution for known and unknown channel parameters are considered. We propose three heuristic algorithms and a method based on Expectation-Maximization for solving the problem. These algorithms represent a combination of iterative optimization techniques and Good-Turing estimators.