English
Related papers

Related papers: On information rates over a binary input channel

200 papers

We study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have…

Information Theory · Computer Science 2011-10-11 Anusha Gorantla , Vinod Sharma

This paper investigates the capacity of a communications channel that, in addition to additive white Gaussian noise, also suffers from interference caused by a co-existing radar transmission. The radar interference (of short duty-cycle and…

Information Theory · Computer Science 2018-10-16 Sara Shahi , Daniela Tuninetti , Natasha Devroye

In this paper, we investigate the problem of transmitting an analog source to a destination over $N$ uses of an additive-white-Gaussian-noise (AWGN) channel, where $N$ is very small (in the order of 10 or even less). The proposed coding…

Information Theory · Computer Science 2024-02-01 Mohammad Ali Maddah-Ali , Soheil Mohajer

A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the…

Information Theory · Computer Science 2014-02-10 Ramji Venkataramanan , S. Sandeep Pradhan

In this paper, we consider single- and multi-user Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities. In the first of two contributions, we study asymptotic expansions for the…

Information Theory · Computer Science 2016-09-22 Lan V. Truong , Silas L. Fong , Vincent Y. F. Tan

For a continuous-time additive white Gaussian noise (AWGN) channel with possible feedback, it has been shown that as sampling gets infinitesimally fine, the mutual information of the associative discrete-time channels converges to that of…

Information Theory · Computer Science 2020-08-26 Guangyue Han , Shlomo Shamai

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

This paper provides a statistical characterization of the individual achievable rates in bits/s/Hz and the spatial throughput of bipolar Poisson wireless networks in bits/s/Hz/m$^2$. We assume that all transmitters have a cognitive ability…

Information Theory · Computer Science 2014-04-29 Pedro H. J. Nardelli , Carlos H. Morais de Lima , Hirley Alves , Paulo Cardieri , Matti Latva-aho

In this paper we study the Z channel with side information non-causally available at the encoders. We use Marton encoding along with Gelfand-Pinsker random binning scheme and Chong-Motani-Garg-El Gamal (CMGE) jointly decoding to find an…

Information Theory · Computer Science 2015-06-03 Saeed Hajizadeh , Mostafa Monemizadeh

We consider performance enhancement of asymmetrically-clipped optical orthogonal frequency division multiplexing (ACO-OFDM) and related optical OFDM schemes, which are variations of OFDM in intensity-modulated optical wireless…

Information Theory · Computer Science 2022-05-05 Xiaozhen Liu , Jing Zhou , Nuo Huang , Wenyi Zhang

We consider the problem of controlling an unstable plant over an additive white Gaussian noise (AWGN) channel with a transmit power constraint, where the signaling rate of communication is larger than the sampling rate (for generating…

Systems and Control · Computer Science 2016-10-31 Anatoly Khina , Gustav M. Pettersson , Victoria Kostina , Babak Hassibi

A waveform channel is considered where the transmitted signal is corrupted by Wiener phase noise and additive white Gaussian noise (AWGN). A discrete-time channel model is introduced that is based on a multi-sample receiver. Tight lower…

Information Theory · Computer Science 2013-03-28 Hassan Ghozlan , Gerhard Kramer

A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show…

Information Theory · Computer Science 2015-08-14 Bin Li , David Tse , Kai Chen , Hui Shen

Probabilistic amplitude shaping (PAS) is a coded modulation strategy in which constellation shaping and channel coding are combined. PAS has attracted considerable attention in both wireless and optical communications. Achievable…

Information Theory · Computer Science 2020-07-14 Yunus Can Gültekin , Alex Alvarado , Frans M. J. Willems

A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which encoders are connected through noiseless links with finite capacities. In this setting, prior to each transmission block the encoders communicate with each other over…

Information Theory · Computer Science 2010-05-28 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

Consider a pair of terminals connected by two independent (feedforward and feedback) Additive White Gaussian Noise (AWGN) channels, and limited by individual power constraints. The first terminal would like to reliably send information to…

Information Theory · Computer Science 2015-04-16 Assaf Ben-Yishai , Ofer Shayevitz

We develop a one-out-of-two oblivious transfer protocol over the binary-input additive white Gaussian noise (BI-AWGN) channel using polar codes. The scheme uses two decoder views linked by automorphisms of the polar transform and publicly…

Information Theory · Computer Science 2026-02-13 Pin-Hsun Lin , Hadi Aghaee , Christian Deppe , Eduard A. Jorswieck , Holger Boche

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number…

Information Theory · Computer Science 2008-03-11 Satish Babu Korada , Nicolas Macris

Orthogonal signaling or Nyquist signaling limits the number of information symbols transmitted in bandwidth $B$ and time $T$ to be $BT$, the time-bandwidth product. Transmitting more than $BT$ symbols leads to loss of orthogonality. The…

Signal Processing · Electrical Eng. & Systems 2025-08-27 Sandesh Rao Mattu , Nishant Mehrotra , Robert Calderbank

In this report, the fundamental limits of simultaneous information and energy transmission in the two-user Gaussian multiple access channel (G-MAC) with and without feedback are fully characterized. More specifically, all the achievable…

Information Theory · Computer Science 2017-03-14 Selma Belhadj Amor , Samir M. Perlaza , Ioannis Krikidis , H. Vincent Poor