English
Related papers

Related papers: Relaxing the Gaussian AVC

200 papers

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 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

In this paper, we first study a two-user interference channel with generalized feedback. We establish an inner bound on its capacity region. The coding scheme that we employ for the inner bound is based on an appropriate combination of…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi

This paper considers the problem of transmitting the difference of two jointly Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC). The goal is to recover this difference within an average mean squared…

Information Theory · Computer Science 2008-12-08 Rajiv Soundararajan , Sriram Vishwanath

The capacity region of a two-transmitter Gaussian multiple access channel (MAC) under average input power constraints is studied, when the receiver employs a zero-threshold one-bit analog-to-digital converter (ADC). It is proved that the…

Information Theory · Computer Science 2018-10-17 Borzoo Rassouli , Morteza Varasteh , Deniz Gunduz

We study communication over a Multiple Access Channel (MAC) where users can possibly be adversarial. The receiver is unaware of the identity of the adversarial users (if any). When all users are non-adversarial, we want their messages to be…

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

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…

Information Theory · Computer Science 2016-11-18 Jingge Zhu , Michael Gastpar

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…

Information Theory · Computer Science 2016-11-17 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

Broadband frequency-selective fading channels usually have the inherent sparse nature. By exploiting the sparsity, adaptive sparse channel estimation (ASCE) methods, e.g., reweighted L1-norm least mean square (RL1-LMS), could bring a…

Information Theory · Computer Science 2015-03-04 Tingping Zhang , Jingpei Dan , Guan Gui

Joint message and state transmission under arbitrarily varying jamming is investigated in this paper. The problem is modeled as the transmission over a channel with random states with a fixed distribution and jamming that varies in an…

Information Theory · Computer Science 2026-02-19 Yiqi Chen , Holger Boche

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

Information Theory · Computer Science 2026-05-13 Adeel Mahmood , Aaron B. Wagner

The paper studies a class of three user Gaussian interference channels. A new layered lattice coding scheme is introduced as a transmission strategy. The use of lattice codes allows for an "alignment" of the interference observed at each…

Information Theory · Computer Science 2008-09-26 Sriram Sridharan , Amin Jafarian , Sriram Vishwanath , Syed A. Jafar , Shlomo Shamai

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information…

Information Theory · Computer Science 2015-03-17 Xiang He , Aylin Yener

Convolutional sparse coding (CSC) can learn representative shift-invariant patterns from multiple kinds of data. However, existing CSC methods can only model noises from Gaussian distribution, which is restrictive and unrealistic. In this…

Machine Learning · Computer Science 2020-04-22 Yaqing Wang , James T. Kwok , Lionel M. Ni

Recent advancements in information technology and the widespread use of the Internet have led to easier access to data worldwide. As a result, transmitting data through noisy channels is inevitable. Reducing the size of data and protecting…

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

Information Theory · Computer Science 2012-08-15 M. V. Burnashev , H. Yamamoto

In this paper, we study a general additive state-dependent Gaussian interference channel (ASD-GIC) where we consider two-user interference channel with two independent states known non-causally at both transmitters, but unknown to either of…

Information Theory · Computer Science 2013-01-24 Shahab Ghasemi-Goojani , Hamid Behroozi

We investigate Gaussian widely linear precoding known as improper Gaussian signaling for the cellular uplink with inter-cell interference, known as interference multiple access channel (IMAC). This transmission scheme provides extra degrees…

Information Theory · Computer Science 2018-05-31 Ali Kariminezhad , Stefan Roth , Aydin Sezgin , Anas Chaaban

Information transmission over discrete-time channels with memoryless additive noise obeying a Cauchy, rather than Gaussian, distribution, are studied. The channel input satisfies an average power constraint. Upper and lower bounds to such…

Information Theory · Computer Science 2024-11-19 Shuqin Pang , Wenyi Zhang

We define the common randomness assisted capacity of an arbitrarily varying channel (AVWC) when the Eavesdropper is kept ignorant about the common randomness. We prove a multi-letter capacity formula for this model. We prove that, if enough…

Information Theory · Computer Science 2016-04-04 Janis Nötzel , Moritz Wiese , Holger Boche
‹ Prev 1 3 4 5 6 7 10 Next ›