Y. Wu is supported in part by the NSF Grant CCF-1749241, an NSF CAREER award CCF-1651588, and an Alfred Sloan fellowship. The research of Y. Polyanskiy was supported by the Center for Science of Information (CSoI), an NSF Science and Technology Cent…
We thank Yihong Wu, Mark Braverman, Rotem Oshman, Himanshu Tyagi and Sahasranand KR for useful discussions. This material is based upon work supported by the National Science Foundation CAREER award under grant agreement CCF-12-53205, the Center for…
In this section, we provide the results of numerical evaluation of the bounds in the paper. We focus on the trade off of user density μ with the minimum energy-per-bit E∗ for a given message size k and target probability of error Pe.
To conclude, we recapitulate the main contributions of this work. For random DAG models with indegree d≥3, we considered the intuitively reasonable setting where all Boolean processing functions are the majority rule. We proved in Theorem 1 that rec…
Credentials & highlights
- Project Views