A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The two-user computation broadcast problem is introduced as the setting where User 1 wants message W 1 and has side-information W ′ 1 , User 2 wants message W 2 and has sideinformation W ′ 2 , and (W 1 , W ′ 1 , W 2 , W ′ 2 ) may have arbitrary dependencies. The rate of a computation broadcast scheme is defined as the ratio H(W 1 , W 2 )/H(S), where S is the information broadcast to both users to simultaneously satisfy their demands. The supremum of achievable rates is called the capacity ofdoi:10.1109/icc.2019.8761676 dblp:conf/icc/SunJ19 fatcat:jkb7nfyh5reofo4n44otkmkade