222 citations · 591 across the 74 of their papers we have counts for
7 papers · 1 filter
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels
Flavio P. Calmon, Yury Polyanskiy, Yihong Wu
This paper quantifies the intuitive observation that adding noise reduces available information by means of non-linear strong data processing inequalities. Consider the random vari…
Bounds for codes on pentagon and other cycles
Marco Dalai, Yury Polyanskiy
The capacity of a graph is defined as the rate of exponential grow of independent sets in the strong powers of the graph. In strong power, an edge connects two sequences if at each…
Strong data-processing inequalities for channels and Bayesian networks
Yury Polyanskiy, Yihong Wu
The data-processing inequality, that is, for a Markov chain , has been the method of choice for proving impossibility (converse) results in infor…
Minimum Energy to Send Bits Over Multiple-Antenna Fading Channels
Wei Yang, Giuseppe Durisi, Yury Polyanskiy
This paper investigates the minimum energy required to transmit information bits with a given reliability over a multiple-antenna Rayleigh block-fading channel, with and withou…
Wasserstein continuity of entropy and outer bounds for interference channels
Yury Polyanskiy, Yihong Wu
It is shown that under suitable regularity conditions, differential entropy is a Lipschitz functional on the space of distributions on -dimensional Euclidean space with respect…
On metric properties of maps between Hamming spaces and related graph homomorphisms
Yury Polyanskiy
A mapping of -bit strings into -bit strings is called an -map if -bit strings which are more than apart are mapped to -bit strings that are more than a…