English
Related papers

Related papers: When Are Popescu-Rohrlich Boxes and Random Access …

200 papers

There is a paucity of random access protocols designed for alleviating collisions in visible light communication (VLC) systems, where carrier sensing is hard to be achieved due to the directionality of light. To resolve the problem of…

Information Theory · Computer Science 2017-08-15 Linlin Zhao , Xuefen Chi , Shaoshi Yang

Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/inference, (approximations to) Algorithmic Probability (AP) and…

Information Theory · Computer Science 2018-04-16 Hector Zenil , Liliana Badillo , Santiago Hernández-Orozco , Francisco Hernández-Quiroz

We consider the problem of efficiently simulating random quantum states and random unitary operators, in a manner which is convincing to unbounded adversaries with black-box oracle access. This problem has previously only been considered…

Quantum Physics · Physics 2020-06-17 Gorjan Alagic , Christian Majenz , Alexander Russell

This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns,…

Information Theory · Computer Science 2019-08-06 Federico Clazzer , Balazs Matuz , Sachini Jayasooriya , Mahyar Shirvanimoghaddam , Sarah J. Johnson

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

In this paper we study one-round key-agreement protocols analogous to Merkle's puzzles in the random oracle model. The players Alice and Bob are allowed to query a random permutation oracle $n$ times and upon their queries and…

Computational Complexity · Computer Science 2009-03-24 Miroslava Sotakova

One of the most promising techniques for network-wide interference management necessitates a redesign of the network architecture known as cloud radio access network (CRAN). The cloud is responsible for coordinating multiple Remote Radio…

Information Theory · Computer Science 2018-06-22 Mohammed S. Al-Abiad , Ahmed Douik , Sameh Sorour , Md Jahangir Hossain

We propose to address the problem of a secondary resource allocation when a primary Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) protocol. The Secondary Users (SUs) intend to use their knowledge of the IR-HARQ protocol…

Information Theory · Computer Science 2013-06-25 Romain Tajan , Charly Poulliat , Inbar Fijalkow

Statistical performance bounds for reinforcement learning (RL) algorithms can be critical for high-stakes applications like healthcare. This paper introduces a new framework for theoretically measuring the performance of such algorithms…

Machine Learning · Computer Science 2018-01-03 Christoph Dann , Tor Lattimore , Emma Brunskill

Unitary gates are an interesting resource for quantum communication in part because they are always invertible and are intrinsically bidirectional. This paper explores these two symmetries: time-reversal and exchange of Alice and Bob. We…

Quantum Physics · Physics 2010-02-01 Aram W. Harrow , Peter W. Shor

In Artificial Intelligence, interpreting the results of a Machine Learning technique often termed as a black box is a difficult task. A counterfactual explanation of a particular "black box" attempts to find the smallest change to the input…

Risk Management · Quantitative Finance 2021-07-23 Dan Wang , Zhi Chen , Ionut Florescu

The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani , Farokh Marvasti

A key aspect of many resource allocation problems is the need for the resource controller to compute a function, such as the max or arg max, of the competing users metrics. Information must be exchanged between the competing users and the…

Information Theory · Computer Science 2014-08-19 Jie Ren , Bradford D. Boyle , Gwanmo Ku , Steven Weber , John MacLaren Walsh

We consider a multi-agent resource allocation setting that models the assignment of papers to reviewers. A recurring issue in allocation problems is the compatibility of welfare/efficiency and fairness. Given an oracle to find a…

Computer Science and Game Theory · Computer Science 2019-08-02 Haris Aziz , Xin Huang , Nicholas Mattei , Erel Segal-Halevi

A random access scheme for the collision channel without feedback is proposed. The scheme is based on erasure correcting codes for the recovery of packet segments that are lost in collisions, and on successive interference cancellation for…

Information Theory · Computer Science 2016-11-17 Enrico Paolini , Gianluigi Liva , Marco Chiani

We propose an irregular repetition slotted ALOHA (IRSA) based random-access protocol for the binary adder channel (BAC). The BAC captures important physical-layer concepts, such as packet generation, per-slot decoding, and information rate,…

Information Theory · Computer Science 2023-02-24 Khac-Hoang Ngo , Alexandre Graell i Amat , Giuseppe Durisi

Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning committee for many ABC rules is NP-hard, natural variations for…

Computer Science and Game Theory · Computer Science 2025-08-06 Zack Fitzsimmons , Zohair Raza Hassan , Edith Hemaspaandra

In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for…

Information Theory · Computer Science 2018-07-24 Alireza Vahid , Robert Calderbank

This paper studies the tradeoff between channel coding and ARQ (automatic repeat request) in Rayleigh block-fading channels. A heavily coded system corresponds to a low transmission rate with few ARQ re-transmissions, whereas lighter coding…

Information Theory · Computer Science 2015-03-13 Peng Wu , Nihar Jindal

The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model,…

Networking and Internet Architecture · Computer Science 2017-07-04 Enrico Paolini , Cedomir Stefanovic , Gianluigi Liva , Petar Popovski