Related papers: When Are Popescu-Rohrlich Boxes and Random Access …
We show that standard nonlocal boxes, also known as Popescu-Rohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known in the multipartite scenario, but we extend the result to…
We consider a secondary user with energy harvesting capability. We design access schemes for the secondary user which incorporate random spectrum sensing and random access, and which make use of the primary automatic repeat request (ARQ)…
We analyze the problem of transmitting information to multiple users over a shared wireless channel. The problem of resource allocation (RA) for the users with the knowledge of their channel state information has been treated extensively in…
We initiate the focused study of constant-cost randomized communication, with emphasis on its connection to graph representations. We observe that constant-cost randomized communication problems are equivalent to hereditary (i.e. closed…
Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…
It has long been known that the existence of certain superquantum nonlocal correlations would cause communication complexity to collapse. The absurdity of a world in which any nonlocal binary function could be evaluated with a constant…
We consider a secondary user (SU) with energy harvesting capability. We design access schemes for the SU which incorporate random spectrum sensing and random access, and which make use of the primary automatic repeat request (ARQ) feedback.…
This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…
We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…
We study coded multichannel random access schemes for ultra-reliable low-latency uplink transmissions. We concentrate on non-orthogonal access in the frequency domain, where users transmit over multiple orthogonal subchannels and inter-user…
We show that standard nonlocal boxes, also known as Popescu-Rohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known in the multipartite scenario, but we extend the result to…
If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information…
This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this…
In this work, we discuss the problem of unsourced random access (URA) over a Gaussian multiple access channel (GMAC). To address the challenges posed by emerging massive machine-type connectivity, URA reframes multiple access as a…
This paper studies the random-coding exponent of joint source-channel coding for the multiple-access channel with correlated sources. For each user, by defining a threshold, the messages of each source are partitioned into two classes. The…
Unsourced random-access (U-RA) is a type of grant-free random access with a virtually unlimited number of users, of which only a certain number $K_a$ are active on the same time slot. Users employ exactly the same codebook, and the task of…
We consider the following communication problem: Alice and Bob each have some valuation functions $v_1(\cdot)$ and $v_2(\cdot)$ over subsets of $m$ items, and their goal is to partition the items into $S, \bar{S}$ in a way that maximizes…
It is demonstrated that identifying information-theoretic limitations of quantum Bell nonlocality alone cannot completely distinguish quantum theory from generalized nonsignaling theories. To this end, an information-theoretic concept of…
A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region [1], and it is shown that the…
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can…