222 citations · 591 across the 74 of their papers we have counts for
6 papers · 1 filter
Defect tolerance: fundamental limits and examples
Jennifer Tang, Da Wang, Yury Polyanskiy +1
This paper addresses the problem of adding redundancy to a collection of physical objects so that the overall system is more robust to failures. In contrast to its information coun…
Comparison of Channels: Criteria for Domination by a Symmetric Channel
Anuran Makur, Yury Polyanskiy
This paper studies the basic question of whether a given channel can be dominated (in the precise sense of being more noisy) by a -ary symmetric channel. The concept of "les…
Rate-distance tradeoff for codes above graph capacity
Daniel Cullina, Marco Dalai, Yury Polyanskiy
The capacity of a graph is defined as the rate of exponential growth of independent sets in the strong powers of the graph. In the strong power an edge connects two sequences if at…
Bounds on the Reliability of a Typewriter Channel
Marco Dalai, Yury Polyanskiy
We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability . The lower bound is more of theoretical than practical importan…
Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
Yury Polyanskiy, Alex Samorodnitsky
Log-Sobolev inequalities (LSIs) upper-bound entropy via a multiple of the Dirichlet form (i.e. norm of a gradient). In this paper we prove a family of entropy-energy inequalities f…
A Beta-Beta Achievability Bound with Applications
Wei Yang, Austin Collins, Giuseppe Durisi +2
A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson functions is proposed. This bound is the dual of a converse bound established ea…