Comments on Cut-Set Bounds on Network Function Computation

A function computation problem over a directed acyclic network has been considered in the literature, where a sink node is required to compute a target function correctly with the inputs arbitrarily generated at multiple source nodes. The network links are error free but capacity limited, and the in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 2018-09, Vol.64 (9), p.6454-6459
Hauptverfasser:	Huang, Cupjin, Tan, Zihan, Yang, Shenghao, Guang, Xuan
Format:	Artikel
Sprache:	eng
Schlagworte:	Computation Computational modeling computing capacity Electronic mail Encoding general cut-set bound information theory Integrated circuits Network coding Network function computation Nodes tightness Upper bound Upper bounds
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!