English
Related papers

Related papers: Identification via Gaussian Multiple Access Channe…

200 papers

In contrast to Shannon transmission codes, the size of identification (ID) codes for discrete memoryless channels (DMCs) experiences doubly exponential growth with the block length when randomized encoding is used. Additional enhancements…

Information Theory · Computer Science 2024-08-21 Yaning Zhao , Wafa Labidi , Holger Boche , Eduard Jorswieck , Christian Deppe

We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…

Information Theory · Computer Science 2022-02-18 Moritz Wiese , Wafa Labidi , Christian Deppe , Holger Boche

We characterize the fundamental limits of transmission of information over a Gaussian multiple access channel (MAC) with the use of variable-length feedback codes and under a non-vanishing error probability formalism. We develop new…

Information Theory · Computer Science 2018-01-10 Lan V. Truong , Vincent Y. F. Tan

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

It is well known that the capacity region of an average transmit power constrained Gaussian Broadcast Channel (GBC) with independent noise realizations at the receivers is enlarged by the presence of causal noiseless feedback. Capacity…

Information Theory · Computer Science 2020-09-21 Aditya Narayan Ravi , Sibi Raj B. Pillai , Vinod Prabhakaran , Michèle Wigger

The identification capacity is developed without randomization at neither the encoder nor the decoder. In particular, full characterization is established for the deterministic identification (DI) capacity for the Gaussian channel and for…

Information Theory · Computer Science 2021-10-11 Mohammad J. Salariseddigh , Uzi Pereg , Holger Boche , Christian Deppe

We investigate how to exploit intermittent feedback for interference management by studying the two-user Gaussian interference channel (IC). We approximately characterize (within a universal constant) the capacity region for the Gaussian IC…

Information Theory · Computer Science 2016-11-17 Can Karakus , I-Hsiang Wang , Suhas Diggavi

For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also another channel with independent additive Gaussian noise (the feedback channel), and the transmitter observes without delay…

Information Theory · Computer Science 2015-01-21 Marat V. Burnashev , Hirosuke Yamamoto

Deterministic identification offers an efficient solution for scenarios where decoding entire messages is unnecessary. It is commonly used in alarm systems and control systems. A key advantage of this approach is that the capacity for…

Information Theory · Computer Science 2025-01-23 Holger Boche , Christian Deppe , Safieh Mahmoodi , Golamreza Omidi

In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…

Information Theory · Computer Science 2017-08-04 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

We characterize the capacity region to within log{2(M-1)} bits/s/Hz for the M-transmitter K-receiver Gaussian multicast channel with feedback where each receiver wishes to decode every message from the M transmitters. Extending…

Information Theory · Computer Science 2012-05-21 Changho Suh , Naveen Goela , Michael Gastpar

We derive lower and upper bounds on the identification capacity of inverse Gaussian channels, a fundamental model for molecular communications in fluid environments. The analysis considers deterministic encoding schemes under a peak time…

Information Theory · Computer Science 2026-05-08 Mohammad Javad Salariseddigh

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

Motivated by the growing application of wireless multi-access networks with stringent delay constraints, we investigate the Gaussian multiple access channel (MAC) in the finite blocklength regime. Building upon information spectrum…

Information Theory · Computer Science 2013-09-11 Ebrahim MolavianJazi , J. Nicholas Laneman

Feedback is shown to increase the sum-rate capacity of K-user Gaussian multiple-access channels by at most a factor of approximately 1.54, improving Thomas' doubling bound (1987). The new bound is the best possible in the sense that it can…

Information Theory · Computer Science 2021-08-24 Gerhard Kramer

Gaussian channels with memory and with noiseless feedback have been widely studied in the information theory literature. However, a coding scheme to achieve the feedback capacity is not available. In this paper, a coding scheme is proposed…

Information Theory · Computer Science 2007-07-13 Jialing Liu , Nicola Elia

Continuing our earlier work (quant-ph/0401060), we give two alternative proofs of the result that a noiseless qubit channel has identification capacity 2: the first is direct by a "maximal code with random extension" argument, the second is…

Quantum Physics · Physics 2017-08-01 Andreas Winter

Numerous applications in the field of molecular communications (MC) such as healthcare systems are often event-driven. The conventional Shannon capacity may not be the appropriate metric for assessing performance in such cases. We propose…

Information Theory · Computer Science 2024-01-30 Wafa Labidi , Christian Deppe , Holger Boche

In this paper, we investigate the signal shaping in a two-user discrete time memoryless Gaussian multiple-access channel (MAC) with computation. It is shown that by optimizing input probability distribution, the transmission rate per…

Information Theory · Computer Science 2017-01-26 Zhiyong Chen , Hui Liu

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2008-03-31 Ender Tekin , Aylin Yener
‹ Prev 1 2 3 10 Next ›