3 citations · 5 across the 2 of their papers we have counts for
2 papers
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.IT2014★ 2 cited
Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels
Daniel Cullina, Negar Kiyavash
Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes.…