Communicating the sum of sources over a network Ramamoorthy, Aditya Ramamoorthy, Aditya
dc.contributor.department Electrical and Computer Engineering 2018-02-18T08:17:32.000 2020-06-30T02:01:31Z 2020-06-30T02:01:31Z Tue Jan 01 00:00:00 UTC 2008 2017-04-03 2008-01-01
dc.description.abstract <p>We consider a network (that is capable of network coding) with a set of sources and terminals, where each terminal is interested in recovering the sum of the sources. Considering directed acyclic graphs with unit capacity edges and independent, unit-entropy sources, we show the rate region when (a) there are two sources and n terminals, and (b) n sources and two terminals. In these cases as long as there exists at least one path from each source to each terminal we demonstrate that there exists a valid assignment of coding vectors to the edges such that the terminals can recover the sum of the sources.</p>
dc.description.comments <p>This is a manuscript of a proceeding from the <em>IEEE International Symposium on Information Theory </em>(2008): 1646, doi:<a href="" target="_blank">10.1109/ISIT.2008.4595267</a>. Posted with permission.</p>
dc.format.mimetype application/pdf
dc.identifier archive/
dc.identifier.articleid 1033
dc.identifier.contextkey 9969328
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath ece_conf/34
dc.language.iso en
dc.source.bitstream archive/|||Fri Jan 14 23:41:01 UTC 2022
dc.source.uri 10.1109/ISIT.2008.4595267
dc.subject.disciplines Signal Processing
dc.subject.disciplines Systems and Communications
dc.title Communicating the sum of sources over a network
dc.type article
dc.type.genre conference
dspace.entity.type Publication
relation.isAuthorOfPublication 8f4839bd-bc09-45dd-863a-1157465ec37a
relation.isOrgUnitOfPublication a75a044c-d11e-44cd-af4f-dab1d83339ff
Original bundle
Now showing 1 - 1 of 1
155.07 KB
Adobe Portable Document Format