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...
Gespeichert in:
| Veröffentlicht in: | Proceedings / IEEE International Symposium on Information Theory S. 1 - 6 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
22.06.2025
|
| Schlagworte: | |
| ISSN: | 2157-8117 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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. |
| Author | Salehi, Mohammad Reza Deylam Purakkal, Vijith Kumar Kizhakke Malak, Derya |
| Author_xml | – sequence: 1 givenname: Mohammad Reza Deylam surname: Salehi fullname: Salehi, Mohammad Reza Deylam email: deylam@eurecom.fr organization: EURECOM,Communication Systems Department,France – sequence: 2 givenname: Vijith Kumar Kizhakke surname: Purakkal fullname: Purakkal, Vijith Kumar Kizhakke email: kizhakke@eurecom.fr organization: EURECOM,Communication Systems Department,France – sequence: 3 givenname: Derya surname: Malak fullname: Malak, Derya email: malak@eurecom.fr organization: EURECOM,Communication Systems Department,France |
| BookMark | eNo1j01PwzAQRA0Cibb0HyDRK4eUXa8de48QUYgUwYHcKzdZS0HUqZL0wL-n4uM0o3eYp5mri9QnUeoWYY0IfF--l3VO4P1ag7YnhmwpxzO1ZMeeCK0hZjhXM43WZR7RXan5OH4AkCPQM3X32qes6pKEYbU5pmbq-rQq-v3hOIWf_jj0oW3COF2ryxg-R1n-5ULVm6e6eMmqt-eyeKiyjmnKWNiI9_akNWhaE60OTgSjdhAj5rmJjUYgEL_Ldd5oYWqNgGED0fOOFurmd7YTke1h6PZh-Nr-P6NvPPtDPQ |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/ISIT63088.2025.11195361 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9798331543990 |
| EISSN | 2157-8117 |
| EndPage | 6 |
| ExternalDocumentID | 11195361 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: European Union grantid: 101077361 funderid: 10.13039/501100000780 |
| GroupedDBID | 6IE 6IH 6IK 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-i93t-9e94e885399414d4f52a7ee1f270ff1664fc21030e8b626c2e93d4e04940f89b3 |
| IEDL.DBID | RIE |
| IngestDate | Wed Oct 29 06:13:08 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i93t-9e94e885399414d4f52a7ee1f270ff1664fc21030e8b626c2e93d4e04940f89b3 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_11195361 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-June-22 |
| PublicationDateYYYYMMDD | 2025-06-22 |
| PublicationDate_xml | – month: 06 year: 2025 text: 2025-June-22 day: 22 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings / IEEE International Symposium on Information Theory |
| PublicationTitleAbbrev | ISIT |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0037302 |
| Score | 1.928061 |
| Snippet | 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... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | characteristic graphs Computation broadcast Computational modeling distributed non-linear function computation Encoding Galois fields Lower bound union graphs |
| Title | Non-Linear Function Computation Broadcast |
| URI | https://ieeexplore.ieee.org/document/11195361 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED5BxcBUHkW8lYGFwW1iX2J7RlR0qSrRoVsVO2epS4ralN-P7SQgBga2yEpi-fw4f_Z99wE8eaco_K44ZzrNDUMhDVO55MwWqlQWkXPjotiEnM_VaqUXHVk9cmGIKAaf0Tg8xrv8amsP4ahskoX8ZCKAnWMpi5as1S-7wg9V3gVwZamezN5ny0L4OeQxIM_H_ae_RFSiD5kO_1n7GYx-2HjJ4tvPnMMR1Rcw7OUYkm52XsLzfFszjy392E2m3l0Fkyfta9H8iYfcZWXLfTOC5fR1-fLGOiUEttGiYZo0klIhiSxmWKHLeSmJMsdl6lxWFOgsD3phpIwHKJaTFhVSSP2SOqWNuIJBva3pGhJTiRRFKQsTGKxZZQw69H_yfSZ1ingDo9Dy9Ueb62LdN_r2j_I7OA32DcFTnN_DoNkd6AFO7Gez2e8eYw99Af7pjuc |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED0hQIKpfBTxTQYWBreJ7cT2jKhaUaJKZOhWxc5Z6pKiNuX3Y7sJiIGBzYocW_bZOT_n3j2AR-cUmTsVp0TFqSacCU1kKigxmSyl4ZxSbYPYhMhzOZ-rWUtWD1wYRAzBZzjwxfAvv1qZrb8qGyY-PxnzYOcgdc3EO7pW9-FlbrHSNoQridVw8j4pMuZ2kUOBNB10L_-SUQleZNT7Z_8n0P_h40Wzb09zCntYn0GvE2SI2v15Dk_5qiYOXbrVG42cw_KTHu2qBQNEDnSXlSk3TR-K0UvxPCatFgJZKtYQhYqjlD6NLE94xW1KS4GYWCpia5Ms49ZQrxiGUjuIYigqVnH0yV9iK5VmF7Bfr2q8hEhXLOasFJn2HNak0ppb7lpyVhMq5vwK-n7ki49dtotFN-jrP54_wNG4eJsuppP89QaO_Vz7UCpKb2G_WW_xDg7NZ7PcrO-Dtb4AopuSLg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+%2F+IEEE+International+Symposium+on+Information+Theory&rft.atitle=Non-Linear+Function+Computation+Broadcast&rft.au=Salehi%2C+Mohammad+Reza+Deylam&rft.au=Purakkal%2C+Vijith+Kumar+Kizhakke&rft.au=Malak%2C+Derya&rft.date=2025-06-22&rft.pub=IEEE&rft.eissn=2157-8117&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FISIT63088.2025.11195361&rft.externalDocID=11195361 |