Computing Vector-Linear Functions on Diamond Network

Network function computation is investigated in the letter. In the model, a target function, of which the inputs are generated at multiple source nodes, is required to be computed with zero error at a sink node over a network. Toward this end, distributed coding by integrating communication and comp...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE communications letters Ročník 26; číslo 7; s. 1519 - 1523
Hlavní autori: Li, Dan, Xu, Yinfei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.07.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:1089-7798, 1558-2558
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Network function computation is investigated in the letter. In the model, a target function, of which the inputs are generated at multiple source nodes, is required to be computed with zero error at a sink node over a network. Toward this end, distributed coding by integrating communication and computation in networks is regarded as an efficient solution. We are interested in its fundamental computing capacity of importance in theory and applications. In the letter, we explicitly characterize the capacities of computing all the vector-linear functions over the diamond network. The diamond network has an important topology structure which not only is typical for many multi-terminal information-theoretic problems but also illustrates the combinatorial nature of the computing problem. By applying the computing capacities thus obtained, we solve the solvability problem of vector-linear functions over the diamond network. We determine all the solvable vector-linear functions and obtain an enhanced result that the remaining vector-linear functions are not only linearly non-solvable but also non-linearly non-solvable.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2022.3170974