English
Related papers

Related papers: Precoding for the AWGN Channel with Discrete Inter…

200 papers

This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the…

Information Theory · Computer Science 2014-02-05 Victoria Kostina , Sergio Verdú

An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…

Information Theory · Computer Science 2015-03-13 Bernd Bandemer , Abbas El Gamal

Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

The capacity of the AWGN broadcast channel is achieved by superposition coding, but superposition of individual coded modulations expands the modulation alphabet and distorts its configuration. Coded modulation over a broadcast channel…

Information Theory · Computer Science 2016-10-31 Ahmed Abotabl , Aria Nosratinia

In this paper, the fundamental limits on the rates at which information and energy can be simultaneously transmitted over an additive white Gaussian noise channel are studied under the following assumptions: $(a)$ the channel is memoryless;…

Information Theory · Computer Science 2021-10-06 Sadaf ul Zuhra , Samir M. Perlaza , Eitan Altman

A restricted two-way communication problem in a small fully-connected network is investigated. The network consists of three nodes, all having access to a common channel with half-duplex constraint. Two nodes want to establish a dialog…

Information Theory · Computer Science 2014-09-05 Manuel Stein

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

The Shannon upper bound places a limit on the error-free information transmission rate (capacity) of a noisy channel. It has stood for over sixty years, and underlies both theoretical and practical work in the telecommunications industry.…

Information Theory · Computer Science 2017-05-08 Jon Montalban , Jon Barrueco , Pablo Angueira , Jerrold D. Prothero

Some new findings for chaos-based wireless communication systems have been identified recently. First, chaos has proven to be the optimal communication waveform because chaotic signals can achieve the maximum signal to noise ratio at…

Signal Processing · Electrical Eng. & Systems 2022-04-21 Hai-Peng Ren , Hong-Er Zhao , Chao Bai , Hui-Ping Yin , Celso Grebogi

Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon [1]. One natural extension is a two-way interference channel (IC) with four independent messages: two associated with…

Information Theory · Computer Science 2017-09-05 Changho Suh , Jaewoong Cho , David Tse

The most natural way to describe an information-carrying system containing a specific noise is an additive white Gaussian-noise (AWGN) channel. In bosonic quantum systems (especially the Gaussian case), although the classical information…

Quantum Physics · Physics 2019-05-14 Kabgyun Jeong , Hun Hee Lee , Youngrong Lim

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

This paper investigates the problem of energy-efficient packet transmission with arbitrary arrival instants and deadline constraints over a point-to-point Additive White Gaussian Noise (AWGN) channel. This is different from previous work…

Networking and Internet Architecture · Computer Science 2015-10-06 Qing Zhou , Nan Liu

We present a unifying framework that bridges Bayesian asymptotics and information theory to analyze the asymptotic Shannon capacity of general large-scale MIMO channels including ones with nonlinearities or imperfect hardware. We derive…

Information Theory · Computer Science 2026-02-24 Sheng Yang , Richard Combes

The enhanced Gaussian noise (EGN) model is widely used for estimating the nonlinear interference (NLI) power accumulated in coherent fiber-optic transmission systems. Given a fixed fiber link, under the assumption that transmitted symbols…

Signal Processing · Electrical Eng. & Systems 2026-04-14 Kaiquan Wu , Gabriele Liga , Marco Secondini , Stella Civelli , Hussam Batshon , Greg Raybon , Xi Chen , Alex Alvarado

In the literature, it has been shown that the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel with noise-free feedback equals the capacity of the same model without secrecy constraint, and the classical…

Information Theory · Computer Science 2026-01-15 Sheng Su , Yuhan Yang , Chao Qi , Xuan He , Bin Dai , Xiaohu Tang

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

This paper investigates the asymptotics of the maximal throughput of communication over AWGN channels by $n$ channel uses under a covert constraint in terms of an upper bound $\delta$ of Kullback-Leibler divergence (KL divergence). It is…

Information Theory · Computer Science 2026-04-08 Xinchun Yu , Shuangqing Wei , Shao-Lun Huang , Xiao-Ping Zhang

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang

An interference alignment perspective is used to identify the simplest instances (minimum possible number of edges in the alignment graph, no more than 2 interfering messages at any destination) of index coding problems where non-Shannon…

Information Theory · Computer Science 2013-03-29 Hua Sun , Syed A. Jafar