级联网络上的函数计算

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI:10.1109/ITW.2012.6404718

Milad Sefidgaran, A. Tchamkerten

{"title":"级联网络上的函数计算","authors":"Milad Sefidgaran, A. Tchamkerten","doi":"10.1109/ITW.2012.6404718","DOIUrl":null,"url":null,"abstract":"A transmitter has access to X, a relay has access to Y, and a receiver has access to Z and wants to compute a given function f(X, Y, Z). How many bits must be transmitted from the transmitter to the relay and from the relay to the receiver so that the latter can reliably recover f(X, Y, Z)? The main result is an inner bound to the rate region of this problem which is tight when X - Y - Z forms a Markov chain.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"On function computation over a cascade network\",\"authors\":\"Milad Sefidgaran, A. Tchamkerten\",\"doi\":\"10.1109/ITW.2012.6404718\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A transmitter has access to X, a relay has access to Y, and a receiver has access to Z and wants to compute a given function f(X, Y, Z). How many bits must be transmitted from the transmitter to the relay and from the relay to the receiver so that the latter can reliably recover f(X, Y, Z)? The main result is an inner bound to the rate region of this problem which is tight when X - Y - Z forms a Markov chain.\",\"PeriodicalId\":325771,\"journal\":{\"name\":\"2012 IEEE Information Theory Workshop\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2012.6404718\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2012.6404718","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

发射机可以访问X，中继器可以访问Y，接收器可以访问Z，并且想要计算一个给定的函数f(X, Y, Z)。发射机向中继器和中继器向接收器必须传输多少位，以便后者能够可靠地恢复f(X, Y, Z)?主要结果是当X - Y - Z形成马尔可夫链时，该问题的速率区是紧的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On function computation over a cascade network

A transmitter has access to X, a relay has access to Y, and a receiver has access to Z and wants to compute a given function f(X, Y, Z). How many bits must be transmitted from the transmitter to the relay and from the relay to the receiver so that the latter can reliably recover f(X, Y, Z)? The main result is an inner bound to the rate region of this problem which is tight when X - Y - Z forms a Markov chain.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 IEEE Information Theory Workshop

自引率

0.00%

发文量