3 citations · 6 across the 6 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.IT2016★ 3 cited
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…
cs.IT2016
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…