11 citations · 21 across the 5 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.IT2011★ 11 cited
Optimal Deterministic Polynomial-Time Data Exchange for Omniscience
Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2
We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a co…
cs.IT2011★ 1 cited
A Compressed Sensing Wire-Tap Channel
Galen Reeves, Naveen Goela, Nebojsa Milosavljevic +1
A multiplicative Gaussian wire-tap channel inspired by compressed sensing is studied. Lower and upper bounds on the secrecy capacity are derived, and shown to be relatively tight i…