2 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
On the solvability of 3-source 3-terminal sum-networks
Sagar Shenvi, Bikash Kumar Dey
We consider a directed acyclic network with three sources and three terminals such that each source independently generates one symbol from a given field and each terminal want…
A Simple Necessary and Sufficient Condition for the Double Unicast Problem
Sagar Shenvi, Bikash Kumar Dey
We consider a directed acyclic network where there are two source-terminal pairs and the terminals need to receive the symbols generated at the respective sources. Each source inde…
Some bounds on the capacity of communicating the sum of sources
Brijesh Kumar Rai, Bikash Kumar Dey, Sagar Shenvi
We consider directed acyclic networks with multiple sources and multiple terminals where each source generates one i.i.d. random process over an abelian group and all the terminals…
"Real" Slepian-Wolf Codes
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac…