activity
20082019
most citedMonotonic convergence of a general algorithm for computing optimal designs

116 citations · 590 across the 35 of their papers we have counts for

collaborators
Showing cs.ITShow all

8 papers · 1 filter

cs.IT2017

An Inequality for the Correlation of Two Functions Operating on Symmetric Bivariate Normal Variables

Ran Hadad, Uri Erez, Yaming Yu

An inequality is derived for the correlation of two univariate functions operating on symmetric bivariate normal random variables. The inequality is a simple consequence of the Cau…

cs.IT2010★ 47 cited

Sharp Bounds on the Entropy of the Poisson Law and Related Quantities

Jose A. Adell, Alberto Lekuona, Yaming Yu

One of the difficulties in calculating the capacity of certain Poisson channels is that H(lambda), the entropy of the Poisson distribution with mean lambda, is not available in a s…

cs.IT2009★ 30 cited

On an Inequality of Karlin and Rinott Concerning Weighted Sums of i.i.d. Random Variables

Yaming Yu

We present an entropy comparison result concerning weighted sums of independent and identically distributed random variables.

cs.IT2009★ 40 cited

Monotonicity, thinning and discrete versions of the Entropy Power Inequality

Oliver Johnson, Yaming Yu

We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinit…

cs.IT2009★ 33 cited

Squeezing the Arimoto-Blahut algorithm for faster convergence

Yaming Yu

The Arimoto--Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A so-called ``squeezing'' strategy is used to design algorithms that preserv…

cs.IT2009★ 14 cited

Concavity of entropy under thinning

Yaming Yu, Oliver Johnson

Building on the recent work of Johnson (2007) and Yu (2008), we prove that entropy is a concave function with respect to the thinning operation T_a. That is, if X and Y are indepen…