The conventional assumption made in the design of communication systems is that the energy used to transfer information between a sender and a recipient cannot be reused for future communication tasks. A notable exception to this norm is given by passive RFID systems, in which a reader can transfer both information and energy via the transmitted radio signal. Conceivably, any system that exchanges information via the transfer of given physical resources (radio waves, particles, qubits) can potentially reuse, at least part, of the received resources for communication later on. In this paper, a two-way communication system is considered that operates with a given initial number of physical resources, referred to as energy units. The energy units are not replenished from outside the system, and are assumed, for simplicity, to be constant over time. A node can either send an "on" symbol (or "1"), which costs one unit of energy, or an "off" signal (or "0"), which does not require any energy expenditure. Upon reception of a "1" signal, the recipient node "harvests" the energy contained in the signal and stores it for future communication tasks. Inner and outer bounds on the achievable rates are derived, and shown via numerical results to coincide if the number of energy units is large enough.
Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity
设X x Y x Z的f子集是一个关系.让f的公共硬币单向通信复杂性,最坏情况误差为1/3,表示为R^{1,pub}_{1/3}(f)。我们证明了如果对于计算f^k(k个f的独立副本),提供o(k R^{1,pub}_{1/3}(f))通信,则成功在k中是指数小的。这解决了公共硬币单向通信复杂性中所有关系的强直积猜想。我们展示了公共硬币单向通信复杂性的新的紧密表征,其加强了[J.,Klauck,Nayak 08].我们使用新的表征,以显示我们的直接产品的结果,这也可能是独立的利益。
Beyond Transmitting Bits: Context, Semantics, and Task-Oriented Communications
Imperial College London(帝国理工学院);Tsinghua University(清华大学);Amazon(亚马逊);Virginia Tech(弗吉尼亚理工学院);Zhejiang Lab(之江实验室);Zhejiang University(浙江大学);The Ohio State University(俄亥俄州立大学);University College London(伦敦大学学院);Yonsei University(延世大学)
A strong direct product theorem for two-way public coin communication complexity
根据我们定义的新复杂性度量,我们展示了所有关系的双向公共币通信复杂性的直接结果。我们的新测度是[J,Klauck and Nayak 08]中的双向乘积子分布界对非乘积分布的推广,从而我们的结果隐含了它们在双向乘积子分布界方面的直接乘积结果.我们证明了我们新的复杂性度量给出了集合不相交问题的紧下界,因此我们重现了这个问题的强直积结果,这是以前由[Klauck 00]证明的。