English
Related papers

Related papers: Zero-Error Communication over Adversarial MACs

200 papers

Traditional studies of multi-source, multi-terminal interference channels typically allow a vanishing probability of error in communication. Motivated by the study of network coding, this work addresses the task of quantifying the loss in…

Information Theory · Computer Science 2013-07-30 Ilia Levi , Dan Vilenchik , Michael Langberg , Michelle Effros

We consider a two-user state-dependent multiaccess channel in which only one of the encoders is informed, non-causally, of the channel states. Two independent messages are transmitted: a common message transmitted by both the informed and…

Information Theory · Computer Science 2016-11-18 Abdellatif Zaidi , Shiva Prasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

In this paper, we study the multiple-antenna wireless communication networks, where a large number of devices simultaneously communicate with an access point. The capacity region of multiple-input multiple-output massive multiple access…

Information Theory · Computer Science 2019-02-13 Fan Wei , Yongpeng Wu , Wen Chen , Wei Yang , Giuseppe Caire

We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each,…

Information Theory · Computer Science 2023-12-08 Gowtham R. Kurri , Viswanathan Ramachandran , Sibi Raj B. Pillai , Vinod M. Prabhakaran

Problems dealing with the ability to take an action that affects the states of state-dependent communication channels are of timely interest and importance. Therefore, we extend the study of action-dependent channels, which until now…

Information Theory · Computer Science 2016-11-18 Lior Dikstein , Haim H. Permuter , Shlomo Shamai

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

In this paper we introduce the two-user asynchronous cognitive multiple access channel (ACMAC). This channel model includes two transmitters, an uninformed one, and an informed one which knows prior to the beginning of a transmission the…

Information Theory · Computer Science 2016-08-10 Michal Yemini , Anelia Somekh-Baruch , Amir Leshem

Designing efficient channel access schemes for wireless communications without any prior knowledge about the nature of environments has been a very challenging issue, especially when the channel states distribution of all spectrum resources…

Networking and Internet Architecture · Computer Science 2016-11-17 Pan Zhou , Tao Jiang

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station.…

Quantum Physics · Physics 2020-04-01 Felix Leditzky , Mohammad A. Alhejji , Joshua Levin , Graeme Smith

We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through…

Information Theory · Computer Science 2010-09-23 I-Hsiang Wang

Multi-agent systems often communicate over low-power shared wireless networks in unlicensed spectrum, prone to denial-of-service attacks. We consider the following scenario: multiple pairs of agents communicating strategically over shared…

Systems and Control · Electrical Eng. & Systems 2023-03-01 Xu Zhang , Marcos M. Vasconcelos

A combinatorial framework for adversarial network coding is presented. Channels are described by specifying the possible actions that one or more (possibly coordinated) adversaries may take. Upper bounds on three notions of capacity (the…

Information Theory · Computer Science 2017-06-20 Alberto Ravagnani , Frank R. Kschischang

This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast…

Information Theory · Computer Science 2019-01-10 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide upper and lower bounds on the capacity of this channel. We then show that, when…

Information Theory · Computer Science 2008-12-04 Nan Liu , Ivana Maric , Andrea Goldsmith , Shlomo Shamai

We investigate the problem of strong coordination over a multiple-access channel (MAC) with cribbing encoders. In this configuration, two encoders observe independent and identically distributed (i.i.d.) samples of a source random variable…

Information Theory · Computer Science 2025-06-06 Viswanathan Ramachandran , Tobias J. Oechtering , Mikael Skoglund

This paper considers the two-user Gaussian interference channel in the presence of adversarial jammers. We first provide a general model including an arbitrary number of jammers, and show that its capacity region is equivalent to that of a…

Information Theory · Computer Science 2017-12-13 Fatemeh Hosseinigoki , Oliver Kosut

This work is motivated by a quite general question: Under which circumstances are the capacities of information transmission systems continuous? The research is explicitly carried out on arbitrarily varying quantum channels (AVQCs). We give…

Quantum Physics · Physics 2015-06-18 H. Boche , J. Noetzel

We study a multiple-input multiple-output (MIMO) multiple access channel (MAC) from several multi-antenna transmitters to a multi-antenna receiver. The fading channels between the transmitters and the receiver are modeled by random…

Information Theory · Computer Science 2011-05-04 Jakob Hoydis , Romain Couillet , Merouane Debbah

We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…

Information Theory · Computer Science 2019-06-11 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

Zero-Error communication investigates communication without any error. By defining channels without probabilities, results from Elias can be used to completely characterize which channel can simulate which other channels. We introduce the…

Information Theory · Computer Science 2016-11-18 Jürg Wullschleger