English
Related papers

Related papers: On information rates over a binary input channel

200 papers

Communication over a multiple access channel is considered. Each user modulates his signal as a superposition of redundant data streams where interconnection of data bits can be represented by means of a sparse graph. The receiver observes…

Information Theory · Computer Science 2011-11-28 Dmitri Truhachev

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

Using ideas from Chu and Bode/Fano theories, we characterize the maximum achievable rate over the single-input single-output wireless communication channels under a restriction on the antenna size at the receiver. By employing…

Information Theory · Computer Science 2021-07-19 Volodymyr Shyianov , Mohamed Akrout , Faouzi Bellili , Amine Mezghani , Robert W. Heath

This paper investigates the capacity region of the three-receiver AWGN broadcast channel where the receivers (i) have private-message requests and (ii) may know some of the messages requested by other receivers as side information. We first…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

The Poltyrev bound provides a very tight upper bound on the decoding error probability when using binary linear codes for transmission over the binary symmetric channel and the additive white Gaussian noise channel, making use of the code's…

Information Theory · Computer Science 2025-01-23 Tal Philosof , Ariel Doubchak , Amit Berman , Uri Erez

New bounds on the semantic secrecy capacity of the binary adversarial wiretap channel are established . Against an adversary which reads a $\rho_r$ fraction of the transmitted codeword and modifies a $\rho_w$ fraction of the codeword, we…

Information Theory · Computer Science 2016-06-14 Carol Wang

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

This paper characterizes the trade-offs between information and energy transmission over an additive white Gaussian noise channel in the finite block-length regime with finite sets of channel input symbols. These trade-offs are…

Information Theory · Computer Science 2023-05-25 Sadaf Ul Zuhra , Samir M. Perlaza , H. Vincent Poor , Mikael Skoglund

In this work, we obtain lower and upper bounds on the maximal transmission rate at a given codeword length $n$, average probability of error $\epsilon$ and power constraint $\bar{P}$, over a finite valued, block fading additive white…

Information Theory · Computer Science 2017-11-15 Deekshith P K , Vinod Sharma

New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the transmitted optical intensity) and by outputs that are…

Information Theory · Computer Science 2009-03-11 Amos Lapidoth , Stefan M. Moser , Michele A. Wigger

New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the transmitted optical intensity) and by outputs that are…

Information Theory · Computer Science 2008-05-06 Amos Lapidoth , Stefan M. Moser , Michele A. Wigger

We consider the problem of jointly optimum modulation and estimation of a real-valued random parameter, conveyed over an additive white Gaussian noise (AWGN) channel, where the performance metric is the large deviations behavior of the…

Information Theory · Computer Science 2016-11-17 Neri Merhav

The best outer bound on the capacity region of the two-user Gaussian Interference Channel (GIC) is known to be the intersection of regions of various bounds including genie-aided outer bounds, in which a genie provides noisy input signals…

Information Theory · Computer Science 2017-04-20 Junyoung Nam

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where…

Information Theory · Computer Science 2009-10-20 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

We consider a communication system where two transmitters wish to exchange information through a half-duplex relay in the middle. The channels between the transmitters and the relay have asymmetric channel gains. More specifically, the…

Information Theory · Computer Science 2009-08-18 Makesh Pravin Wilson , Krishna Narayanan

We consider the classical AWGN channel where the channel input is constrained to an amplitude constraint that stochastically varies at each channel use, independent of the message. This is an abstraction of an energy harvesting transmitter…

Information Theory · Computer Science 2012-01-24 Omur Ozel , Sennur Ulukus

The dependency between the Gaussianity of the input distribution for the additive white Gaussian noise (AWGN) channel and the gap-to-capacity is discussed. We show that a set of particular approximations to the Maxwell-Boltzmann (MB)…

Signal Processing · Electrical Eng. & Systems 2019-12-02 Yunus Can Gültekin , W. J. van Houtum , Arie Koppelaar , Frans M. J. Willems

In this correspondence, we correct an erroneous result on the achievability part of the R\'enyi common information with order $1+s\in(1,2]$ in [1]. The new achievability result (upper bound) of the R\'enyi common information no longer…

Information Theory · Computer Science 2020-02-18 Lei Yu , Vincent Y. F. Tan

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

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