Network Coding for Computing: Cut-Set Bounds

The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function f of the messages. The objective is to maximize the average number of times f can be computed per network usage, i.e.,...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 57; no. 2; pp. 1015 - 1030
Main Authors:	Appuswamy, R, Franceschetti, M, Karamchandani, N, Zeger, K
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.02.2011 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Capacity Coding Computation Computational modeling cut-set bound Encoding function computation Indexes information theory Mathematical analysis Mathematical models Messages Network coding Networks Receivers Steiner trees Studies throughput Upper bound Upper bounds
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!