English
Related papers

Related papers: Completion Time in Multi-Access Channel: An Inform…

200 papers

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give single-letter identification capacity formulas for discrete…

Information Theory · Computer Science 2021-12-03 Johannes Rosenberger , Uzi Pereg , Christian Deppe

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region is comprised of the rates at which it…

Quantum Physics · Physics 2011-10-25 Jon Yard , Igor Devetak , Patrick Hayden

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, we study the achievable…

Information Theory · Computer Science 2009-10-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…

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

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

We consider the capacity region of a $K$-user multiple access channel (MAC) with energy harvesting transmitters. Each user stores and schedules the randomly arriving energy using an energy buffer. Users can also perform energy cooperation…

Information Theory · Computer Science 2017-02-10 Yunquan Dong , Zhengchuan Chen , Pingyi Fan

The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We provided a sequence of inner and outer bounds for this…

Information Theory · Computer Science 2008-02-12 Haim H. Permuter , Tsachy Weissman , Jun Chen

A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial…

Information Theory · Computer Science 2010-12-10 Giacomo Como , Serdar Yüksel

In present work, we present a couple-channel formalism for the description of tunneling time of a quantum particle through a composite compound with multiple energy levels or a complex structure that can be reduced to a…

Other Condensed Matter · Physics 2026-05-01 Peng Guo , Vladimir Gasparian , Antonio Pérez-Garrido , Esther Jódar

We consider the communication scenario where multiple cognitive users wish to communicate to the same receiver, in the presence of primary transmission. The cognitive transmitters are assumed to have the side information about the primary…

Information Theory · Computer Science 2007-07-13 Peng Cheng , Guanding Yu , Zhaoyang Zhang , Hsiao-Hwa Chen , Peiliang Qiu

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

This paper studies a wireless network consisting of multiple transmitter-receiver pairs where interference is treated as noise. Previously, the throughput region of such networks was characterized for either one time slot or an infinite…

Information Theory · Computer Science 2016-11-08 Yirui Cong , Xiangyun Zhou , Rodney A. Kennedy

We derive the optimal resource allocation of a practical half-duplex scheme for the Gaussian multiple access channel with transmitter cooperation (MAC-TC). Based on rate splitting and superposition coding, two users transmit information to…

Information Theory · Computer Science 2015-03-20 Ahmad Abu Al Haija , Mai Vu

The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of…

Information Theory · Computer Science 2007-08-09 Yoichiro Watanabe , Koichi Kamoi

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

Information Theory · Computer Science 2015-03-18 Sanjay Karmakar , Mahesh K. Varanasi

The capacity region of a multiple access channel is discussed. It was found that orthogonal multiple access and non orthogonal multiple access have the same capacity region under the constraint of same sum power.

Information Theory · Computer Science 2016-05-11 Xuezhi Yang

We consider a cognitive radio network in a multi-channel licensed environment. Secondary user transmits in a channel if the channel is sensed to be vacant. This results in a tradeoff between sensing time and transmission time. When…

Information Theory · Computer Science 2017-01-24 Kedar Kulkarni , Adrish Banerjee

A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of all other users. A convex cost function of the completion times…

Information Theory · Computer Science 2011-04-06 Chris T. K. Ng , Muriel Medard , Asuman Ozdaglar