中文
相关论文

相关论文: Multiple-Access Bosonic Communications

200 篇论文

This paper addresses the problem of distributed state estimation via multiple access channels (MACs). We consider a scenario where two encoders are simultaneously communicating their measurements through a noisy channel. Firstly, the…

系统与控制 · 电气工程与系统科学 2022-12-23 Ghassen Zafzouf , Girish N. Nair , Farhad Farokhi

It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent…

信息论 · 计算机科学 2016-11-18 Min Li , Osvaldo Simeone , Aylin Yener

We determine the ultimate classical information capacity of a linear time-invariant bosonic channel with additive phase-insensitive Gaussian noise. This channel can model fiber-optic communication at power levels below the threshold for…

量子物理 · 物理学 2016-04-06 Bhaskar Roy Bardhan , Jeffrey H. Shapiro

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, the effective capacity region…

信息论 · 计算机科学 2010-09-17 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

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…

信息论 · 计算机科学 2008-02-12 Haim H. Permuter , Tsachy Weissman , Jun Chen

In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…

信息论 · 计算机科学 2016-11-17 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…

信息论 · 计算机科学 2025-06-19 Yao Liu , Min Li , An Liu , Lawrence Ong , Aylin Yener

Identification in quantum communication enables receivers to verify the presence of a message without decoding its entire content. While identification capacity has been explored for classical and finite-dimensional quantum channels, its…

量子物理 · 物理学 2025-12-02 Zuhra Amiri , Janis Nötzel

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…

量子物理 · 物理学 2013-10-09 Holger Boche , Janis Noetzel

We prove that several known upper bounds on the classical capacity of thermal and additive noise bosonic channels are actually strong converse rates. Our results strengthen the interpretation of these upper bounds, in the sense that we now…

量子物理 · 物理学 2014-07-29 Bhaskar Roy Bardhan , Mark M. Wilde

In this paper, we consider the finite-state multiple access channel (MAC) with partially cooperative encoders and delayed channel state information (CSI). Here partial cooperation refers to the communication between the encoders via…

信息论 · 计算机科学 2016-11-17 Ziv Goldfeld , Haim H. Permuter , Benjamin M. Zaidel

We characterize stability regions of two-user fading Gaussian multiple access (MAC) and broadcast (BC) networks with centralized scheduling. The data to be transmitted to the users is encoded into codewords of fixed length. The rates of the…

信息论 · 计算机科学 2007-07-13 Viveck R. Cadambe , Syed A. Jafar

Bosonic channels are important in practice as they form a simple model for free-space or fiber-optic communication. Here we consider a single-sender two-receiver pure-loss bosonic broadcast channel and determine the unconstrained capacity…

量子物理 · 物理学 2016-11-15 Masahiro Takeoka , Kaushik P. Seshadreesan , Mark M. Wilde

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…

信息论 · 计算机科学 2009-10-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…

信息论 · 计算机科学 2018-09-05 Yimin Pang , Mahesh K. Varanasi

The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…

量子物理 · 物理学 2009-11-10 Garry Bowen , Igor Devetak , Stefano Mancini

The classical capacity of the lossy bosonic channel is calculated exactly. It is shown that its Holevo information is not superadditive, and that a coherent-state encoding achieves capacity. The capacity of far-field, free-space optical…

The achievable rate of information transfer in optical communications is determined by the physical properties of the communication channel, such as the intrinsic channel noise. Bosonic phase-noise channels, a class of non-Gaussian…

量子物理 · 物理学 2019-08-08 M. T. DiMario , L. Kunz , K Banaszek , F. E. Becerra

We consider the compound memoryless quantum multiple-access channel (QMAC) with two sending terminals. In this model, the transmission is governed by the memoryless extensions of a completely positive and trace preserving map which can be…

量子物理 · 物理学 2019-06-25 Holger Boche , Gisbert Janßen , Sajad Saeedinaeeni

We study covert classical communication over a quantum multiple-access channel (MAC) with a helper. Specifically, we consider three transmitters, where one transmitter helps the other two transmitters communicate covertly with a receiver.…

信息论 · 计算机科学 2025-12-03 Hassan ZivariFard , Rémi A. Chou , Xiaodong Wang