42 citations · 161 across the 18 of their papers we have counts for
Showing 2016 · cs.ITShow all
2 papers · 2 filters
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
Improved Achievability and Converse Bounds for Erdős-Rényi Graph Matching
Daniel Cullina, Negar Kiyavash
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdős-Rényi (ER) graphs. For a pair of correlated graphs on the same vertex set, th…