1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.IT2009
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…
cs.IT2008★ 1 cited
"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…