Bin YuAuthors Info & ClaimsThe problem of providing bounds on the redundancy of an optimal code for a discrete memoryless source in terms of the probability distribution of the source, has been extensively studied in the literature. The attention has mainly focused on binary ...
In this article, we study the problem of finding tight bounds on the expected value of the kth-order statistic E [Xk:n] under first and second moment information on n real-valued random variables. Given means E [Xi] = μi and variances Var[Xi] = σi2, we ...
In this paper, we establish upper and lower bounds for some statistical estimation problems through concise information-theoretic arguments. Our upper bound analysis is based on a simple yet general inequality which we call the information exponential ...
IEEE Press
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in