English
Related papers

Related papers: Explicit Lower Bounds on the Outage Probability of…

200 papers

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang , Ralf Kötter

In this paper, we present an analytical lower bound on the ergodic capacity of optical multiple-input multiple-output (MIMO) channels. It turns out that the optical MIMO channel matrix which couples the mt inputs (modes/cores) into mr…

Information Theory · Computer Science 2017-02-01 Rémi Bonnefoi , Amor Nafkha

Given a correlation generated by a (possibly quantum) communication network, we study the amount of shared randomness required to generate it. We develop a novel upper bound for approximating distributions generated by arbitrary networks…

Quantum Physics · Physics 2026-03-16 Yukari Uchibori , Alice Zheng , Anurag Anshu , Jamie Sikora

In this paper, we discuss a non-orthogonal multiple access (NOMA) scheme to exploit a high diversity gain using repetition, namely repetition-based NOMA. Unlike conventional power-domain NOMA, all the users can have the same transmit power,…

Information Theory · Computer Science 2020-04-03 Jinho Choi

This letter puts forth an analytical approach to evaluate the outage probability of power-based NOMA on the uplink of a 5G cell, the outage being defined as the event where the receiver fails to successfully decode all the simultaneously…

Information Theory · Computer Science 2017-07-06 Maria Luisa Merani

We investigate the effect of imperfect feedback on the \epsilon-outage capacity of incremental relaying in the low signal-to-noise ratio (SNR) regime. We show that imperfect feedback leads to a rescaling of the pre-log factor (comparable to…

Information Theory · Computer Science 2010-01-14 Tobias Renk , Holger Jaekel , Friedrich Jondral

Measurements of a scalar linear Gauss-Markov process are sent over a fading channel. The fading channel is modeled as independent and identically distributed random variables with known realization at the receiver. The optimal estimator at…

Information Theory · Computer Science 2014-10-20 Reza Parseh , Kimmo Kansanen

This paper is concerned with a wireless system operating in MIMO fading channels with channel state information being known at both transmitter and receiver. By spatiotemporal subchannel selection and power control, it aims to minimize the…

Information Theory · Computer Science 2014-03-27 Dian-Wu Yue , Yichuang Sun

In this paper we obtain a lower bound of exponent of average probability of error for classical quantum multiple access channel, which implies that for all rate pairs in the capacity region is achievable by a code with exponential…

Quantum Physics · Physics 2017-02-08 Masahito Hayashi , Ning Cai

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

Information Theory · Computer Science 2020-08-19 Gonzalo Vazquez-Vilar

We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…

Information Theory · Computer Science 2022-09-05 Anelia Somekh-Baruch

We consider the decoding of bit interleaved coded modulation (BICM) applied to multiband OFDM for practical scenarios where only a noisy (possibly very bad) estimate of the channel is available at the receiver. First, a decoding metric…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed…

Information Theory · Computer Science 2015-07-28 Laura Luzzi , Roope Vehkalahti

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

We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information…

Information Theory · Computer Science 2007-07-16 Nandakishore Santhi , Alexander Vardy

This paper presents an analytical investigation on the outage performance of dual-hop multiple antenna amplify-and-forward relaying systems in the presence of interference. For both the fixed-gain and variable-gain relaying schemes, exact…

Information Theory · Computer Science 2016-11-15 Caijun Zhong , Himal A. Suraweera , Aiping Huang , Zhaoyang Zhang , Chau Yuen

This paper explores multiuser multiple antenna systems as a means to enhance the spectral efficiency of aeronautical communications systems. To this end, the outage regime for a multiuser multiple antenna system is studied within a…

Information Theory · Computer Science 2025-08-28 Ayten Gürbüz , Giuseppe Caire , Alexander Steingass

We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN)…

Information Theory · Computer Science 2012-03-30 Mojtaba Rahmati , Tolga M. Duman

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…

Information Theory · Computer Science 2017-12-19 Johan Östman , Giuseppe Durisi , Erik G. Ström , Mustafa C. Coşkun , Gianluigi Liva

This paper provides new insight into the classical problem of determining both the capacity of the discrete-time channel with uniform output quantization and the capacity achieving input distribution. It builds on earlier work by Gallager…

Information Theory · Computer Science 2009-01-19 Yiyue Wu , Linda M. Davis , Robert Calderbank