2 citations · 2 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.IT2009★ 2 cited
Feasible alphabets for communicating the sum of sources over a network
Brijesh Kumar Rai, Bikash Kumar Dey
We consider directed acyclic {\em sum-networks} with sources and terminals where the sources generate symbols from an arbitrary alphabet field , and the terminals need t…