50 citations · 383 across the 69 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
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.…
cs.IT2014★ 2 cited
Quantifying the Information Leakage in Timing Side Channels in Deterministic Work-Conserving Schedulers
Xun Gong, Negar Kiyavash
When multiple job processes are served by a single scheduler, the queueing delays of one process are often affected by the others, resulting in a timing side channel that leaks the…