activity
20052009
most citedAsymptotics of input-constrained binary symmetric channel capacity

27 citations · 28 across the 5 of their papers we have counts for

collaborators

6 papers

math.DS2009

A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes

Guangyue Han, Brian Marcus, Yuval Peres

In this note, we show that small complex perturbations of positive matrices are contractions, with respect to a complex version of the Hilbert metric, on the standard complex simpl…

cs.IT20091 cited

Improved Lower Bounds on Capacities of Symmetric 2-Dimensional Constraints using Rayleigh Quotients

Erez Louidor, Brian Marcus

A method for computing lower bounds on capacities of 2-dimensional constraints having a symmetric presentation in either the horizontal or the vertical direction is presented. The…

cs.IT2008

Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains

Guangyue Han, Brian Marcus

We derive an asymptotic formula for entropy rate of a hidden Markov chain around a "weak Black Hole". We also discuss applications of the asymptotic formula to the asymptotic behav…

math.PR200827 cited

Asymptotics of input-constrained binary symmetric channel capacity

Guangyue Han, Brian Marcus

We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from…

cs.IT2006

Derivatives of Entropy Rate in Special Families of Hidden Markov Chains

Guangyue Han, Brian Marcus

Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13], [14] showed how, in principle, one can explici…

math.PR2005

Analyticity of Entropy Rate of Hidden Markov Chains

Guangyue Han, Brian Marcus

We prove that under mild positivity assumptions the entropy rate of a hidden Markov chain varies analytically as a function of the underlying Markov chain parameters. A general pri…