Non-Linear Function Computation Broadcast

This work addresses the K -user computation broadcast problem consisting of a master node, which holds all datasets, and users for a general class of function demands, including linear and non-linear functions, over finite fields. The master node sends a broadcast message to enable each of K distrib...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings / IEEE International Symposium on Information Theory s. 1 - 6
Hlavní autori: Salehi, Mohammad Reza Deylam, Purakkal, Vijith Kumar Kizhakke, Malak, Derya
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 22.06.2025
Predmet:
characteristic graphs
Computation broadcast
Computational modeling
distributed non-linear function computation
Encoding
Galois fields
Lower bound
union graphs
ISSN:2157-8117
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This work addresses the K -user computation broadcast problem consisting of a master node, which holds all datasets, and users for a general class of function demands, including linear and non-linear functions, over finite fields. The master node sends a broadcast message to enable each of K distributed users to compute its demanded function in an asymptotically lossless manner with user's side information. We derive bounds on the optimal K -user computation broadcast rate that allows the users to compute their demanded functions by capturing the structures of the computations and available side information. Our achievability scheme involves the design of a novel graph-based coding model to build a broadcast message to meet each user's demand, by leveraging the structural dependencies among the datasets, the user demands, and the side information of each user, drawing on Körner's characteristic graph framework. The converse uses the structures of the demands and the side information available at K users to yield a tight lower bound on the broadcast rate. With the help of examples, we demonstrate our scheme achieves a better communication rate than the existing state of the art.
ISSN:2157-8117
DOI:10.1109/ISIT63088.2025.11195361