Computing sum of sources over an arbitrary multiple access channel
暂无分享,去创建一个
[1] Michael Gastpar,et al. Computation Over Multiple-Access Channels , 2007, IEEE Transactions on Information Theory.
[2] Eli Haim,et al. Expurgation for discrete multiple-access channels via linear codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[3] Rudolf Ahlswede,et al. On source coding with side information via a multiple-access channel and related problems in multi-user information theory , 1983, IEEE Trans. Inf. Theory.
[4] Tetsunao Matsuta,et al. 国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .
[5] Giuseppe Longo,et al. The information theory approach to communications , 1977 .
[6] János Körner,et al. How to encode the modulo-two sum of binary sources (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[7] Arun Padakandla,et al. Nested linear codes achieve Marton's inner bound for general broadcast channels , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[8] L. Goddard. Information Theory , 1962, Nature.