Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks
暂无分享,去创建一个
[1] Abbas El Gamal,et al. Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).
[2] Yaming Yu,et al. Sharp Bounds on the Entropy of the Poisson Law and Related Quantities , 2010, IEEE Transactions on Information Theory.
[3] Michael Gastpar,et al. Computation over Gaussian networks with orthogonal components , 2013, 2013 IEEE International Symposium on Information Theory.
[4] Panganamala Ramana Kumar,et al. Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.
[5] Thomas M. Cover,et al. Elements of information theory (2. ed.) , 2006 .
[6] Alon Orlitsky,et al. Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[7] Thomas M. Cover,et al. Network Information Theory , 2001 .
[8] Peter Harremoës,et al. Binomial and Poisson distributions as maximum entropy distributions , 2001, IEEE Trans. Inf. Theory.
[9] Michael Gastpar,et al. Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.
[10] Ingram Olkin,et al. Entropy of the Sum of Independent Bernoulli Random Variables and of the Multinomial Distribution , 1981 .
[11] Prakash Ishwar,et al. Some Results on Distributed Source Coding for Interactive Function Computation , 2011, IEEE Transactions on Information Theory.
[12] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[13] Michael Gastpar,et al. Computation Over Multiple-Access Channels , 2007, IEEE Transactions on Information Theory.
[14] Piyush Gupta,et al. Interactive Source Coding for Function Computation in Collocated Networks , 2012, IEEE Transactions on Information Theory.