English
Related papers

Related papers: The Arbitrarily Varying Multiple-Access Channel wi…

200 papers

We introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system. We consider a two-user discrete memoryless multiple access channel where either user may deviate from the prescribed…

Information Theory · Computer Science 2024-09-26 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

We consider the problem of broadcast with common messages, and focus on the case that the common message rate $R_{\mathcal{A}}$, i.e., the rate of the message intended for all the receivers in the set $\mathcal{A}$, is the same for all the…

Information Theory · Computer Science 2016-11-17 Chao Tian

The problem of simultaneous multicasting of multiple messages with the help of a relay terminal is considered. In particular, a model is studied in which a relay station simultaneously assists two transmitters in multicasting their…

Information Theory · Computer Science 2009-02-19 Deniz Gunduz , Osvaldo Simeone , Andrea J. Goldsmith , H. Vincent Poor , Shlomo Shamai

In this paper, we study the effect of feedback on two-user MIMO interference channels. The capacity region of MIMO interference channels with feedback is characterized within a constant number of bits, where this constant is independent of…

Information Theory · Computer Science 2014-07-15 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their…

Quantum Physics · Physics 2013-10-09 Holger Boche , Janis Noetzel

We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels.Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender…

Information Theory · Computer Science 2016-12-30 Holger Boche , Minglai Cai , Christian Deppe , Janis Nötzel

A memoryless state-dependent multiple access channel (MAC) is considered where two transmitters wish to convey a respective message to a receiver while simultaneously estimating the respective channel state via generalized feedback. The…

Information Theory · Computer Science 2019-02-12 Mari Kobayashi , Hassan Hamad , Gerhard Kramer , Giuseppe Caire

Extension of point-to-point communication model to the realm of multi-node configurations finds a plethora of applications in internet and telecommunication networks. Here, we establish a novel advantage of quantum communication in a…

In this paper, we make use of channel symmetry properties to determine the capacity region of three types of two-way networks: (a) two-user memoryless two-way channels (TWCs), (b) two-user TWCs with memory, and (c) three-user…

Information Theory · Computer Science 2019-10-02 Jian-Jia Weng , Lin Song , Fady Alajaji , Tamás Linder

Multiple-input multiple-output (MIMO) or multi-antenna communication is a key technique to achieve high spectral efficiency in wireless systems. For the point-to-point MIMO channel, it is a well-known result that the channel singular value…

Information Theory · Computer Science 2016-11-17 Liang Liu , Rui Zhang

We study a special class of the cognitive radio channel in which the receiver of the cognitive pair does not suffer interference from the primary user. Previously developed general encoding schemes for this channel are complex as they…

Information Theory · Computer Science 2010-09-22 Jinhua Jiang , Ivana Maric , Andrea Goldsmith , Shlomo Shamai , Shuguang Cui

We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another…

Information Theory · Computer Science 2017-04-26 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

We study channel resolvability for the discrete memoryless multiple-access channel with cribbing, i.e., the characterization of the amount of randomness required at the inputs to approximately produce a chosen i.i.d. output distribution…

Information Theory · Computer Science 2018-11-29 Noha Helal , Matthieu Bloch , Aria Nosratinia

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. As in the model recently introduced by Polyanskiy for the Multiple Access Channel (MAC) with a fixed, known…

Information Theory · Computer Science 2021-03-19 Recep Can Yavas , Victoria Kostina , Michelle Effros

The question of robust direct communication in vehicular networks is discussed. In most state-of-the-art approaches, there is no central entity controlling channel access, so there may be arbitrary interference from other parties. Thus, a…

Information Theory · Computer Science 2017-10-31 Christian Arendt , Janis Nötzel , Holger Boche

We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to…

Information Theory · Computer Science 2010-05-20 Changho Suh , David Tse

Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…

Information Theory · Computer Science 2020-02-04 Lóránt Farkas , Tamás Kói

Arbitrarily varying channels offer a powerful framework for analyzing the robustness of quantum communication systems, especially for classical-quantum models, where the analysis displays strengths or weaknesses of specific signal…

Quantum Physics · Physics 2025-07-25 Janis Nötzel , Florian Seitz

A mechanism called switched feedback is introduced; under switched feedback, each channel output goes forward to the receiver(s) or back to the transmitter(s) but never both. By studying the capacity of the Multiple-Access Channel (MAC)…

Information Theory · Computer Science 2025-05-01 Oliver Kosut , Michael Langberg , Michelle Effros

We study the achievable capacity regions of full-duplex links in the single- and multi-channel cases (in the latter case, the channels are assumed to be orthogonal -- e.g., OFDM). We present analytical results that characterize the uplink…

Networking and Internet Architecture · Computer Science 2016-05-25 Jelena Marašević , Gil Zussman