English
Related papers

Related papers: A Finite-Blocklength Perspective on Gaussian Multi…

200 papers

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

For a physical layer message authentication procedure based on the comparison of channel estimates obtained from the received messages, we focus on an outer bound on the type I/II error probability region. Channel estimates are modelled as…

Information Theory · Computer Science 2016-10-05 Augusto Ferrante , Nicola Laurenti , Chiara Masiero , Michele Pavon , Stefano Tomasin

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

Meeting the challenges of 5G demands better exploitation of the available spectrum by allowing multiple parties to share resources. For instance, a secondary unlicensed system can share resources with the cellular uplink of a primary…

Information Theory · Computer Science 2016-07-08 Ali Kariminezhad , Anas Chaaban , Aydin Sezgin

This paper studies an $n$-dimensional additive Gaussian noise channel with a peak-power-constrained input. It is well known that, in this case, when $n=1$ the capacity-achieving input distribution is discrete with finitely many mass points,…

Information Theory · Computer Science 2019-11-18 Alex Dytso , Semih Yagli , H. Vincent Poor , Shlomo Shamai

We consider a state-dependent multiaccess channel (MAC) with state non-causally known to some encoders. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In…

Information Theory · Computer Science 2008-03-30 Shiva Prasad Kotagiri , J. Nicholas Laneman

A network of 3 nodes mutually communicating with each other is studied. This multi-way network is a suitable model for 3-user device-to-device communications. The main goal of this paper is to characterize the capacity region of the…

Information Theory · Computer Science 2016-11-17 Anas Chaaban , Henning Maier , Aydin Sezgin , Rudolf Mathar

This paper investigates the problem of Gaussian approximation for the wireless multi-access interference distribution in large spatial wireless networks. First, a principled methodology is presented to establish rates of convergence of the…

Probability · Mathematics 2015-06-04 Hazer Inaltekin

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…

We study the network spectral efficiency of decentralized vector multiple access channels (MACs) when the number of accessible dimensions per transmitter is strategically limited. Considering each dimension as a frequency band, we call this…

Information Theory · Computer Science 2009-05-19 Samir M. Perlaza , Merouane Debbah , Samson Lasaulce , Hanna Bogucka

We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability.…

Information Theory · Computer Science 2025-04-28 Matthias Frey , Igor Bjelaković , Michael C. Gastpar , Jingge Zhu

We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook with entries generated from a $q$-ary alphabet. At each…

Information Theory · Computer Science 2022-10-06 Alejandro Lancho , Alexander Fengler , Yury Polyanskiy

This article shows that the capacity region of a two users weak Gaussian interference channel can be achieved using single letter Gaussian code-books. The approach relies on traversing the boundary in incremental steps. Starting from a…

Information Theory · Computer Science 2026-05-18 Amir K. Khandani

Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within one bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users.…

Information Theory · Computer Science 2016-11-17 Guy Bresler , Abhay Parekh , David Tse

This paper investigates the capacity and capacity per unit cost of Gaussian multiple access-channel (GMAC) with peak power constraints. We first devise an approach based on Blahut-Arimoto Algorithm to numerically optimize the sum rate and…

Information Theory · Computer Science 2015-02-24 Siavash Ghavami , Farshad Lahouti

We consider an energy harvesting multiple access channel (MAC) where the transmitters are powered by an exogenous stochastic energy harvesting process and equipped with finite batteries. We characterize the capacity region of this channel…

Information Theory · Computer Science 2016-08-23 Huseyin A. Inan , Dor Shaviv , Ayfer Ozgur

We determine both the random code capacity region and the deterministic code capacity region of the arbitrarily varying multiple access channel (AVMAC) under input and state constraints. As in the single user case, the boundary of the…

Information Theory · Computer Science 2020-07-03 Uzi Pereg , Yossef Steinberg

We consider a single-antenna Gaussian multiple-access channel (MAC) with a multiple-antenna amplify-and-forward (AF) relay, where, contrary to many previous works, also the direct links between transmitters and receiver are taken into…

Information Theory · Computer Science 2012-07-09 Frederic Knabe , Omar Mohamed , Carolin Huppert

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

We consider the usage of finite-length polar codes for the Gaussian multiple access channel (GMAC) with a finite number of users. Based on the interleave-division multipleaccess (IDMA) concept, we implement an iterative detection and…

Information Theory · Computer Science 2020-12-04 Moustafa Ebada , Sebastian Cammerer , Ahmed Elkelesh , Marvin Geiselhart , Stephan ten Brink