相关论文: The Arbitrarily Varying Channel with Colored Gauss…

The identification capacity is developed without randomization at neither the encoder nor the decoder. In particular, full characterization is established for the deterministic identification (DI) capacity for the Gaussian channel and for…

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…

We address the problem of finding the capacity of noisy networks with either independent point-to-point compound channels (CC) or arbitrarily varying channels (AVC). These channels model the presence of a Byzantine adversary which controls…

Non-malleable codes protect against an adversary who can tamper with the coded message by using a tampering function in a specified function family, guaranteeing that the tampering result will only depend on the chosen function and not the…

We present a family of relatively simple and unified lower bounds on the capacity of the Gaussian channel under a set of pointwise additive input constraints. Specifically, the admissible channel input vectors $\bx = (x_1, \ldots, x_n)$…

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…

Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…

The paper provides a new perspective on peak- and average-constrained Gaussian channels. Such channels model optical wireless communication (OWC) systems which employ intensity-modulation with direct detection (IM/DD). First, the paper…

The full solution of the optimization problem giving the Gaussian capacity of the single-mode fiducial Gaussian quantum channel is provided. Since it was shown that the Gaussian capacity of an arbitrary (phase-sensitive or insensitive)…

It is well known that the problem of computing the feedback capacity of a stationary Gaussian channel can be recast as an infinite-dimensional optimization problem; moreover, necessary and sufficient conditions for the optimality of a…

We study universal decoding over unknown discrete additive channels determined by a finite-state (unifilar) random process. Aiming at low-complexity decoders, we study variants of noise-guessing decoders that use estimators for the…

This paper characterizes the capacity region of Gaussian MIMO broadcast channels (BCs) with per-antenna power constraint (PAPC). While the capacity region of MIMO BCs with a sum power constraint (SPC) was extensively studied, that under…

We consider the additive white Gaussian noise channels. We prove that the error probability of decoding tends to one exponentially for rates above the capacity and derive the optimal exponent function. We shall demonstrate that the…

In this paper, we relate a feedback channel with any finite-order autoregressive moving-average (ARMA) Gaussian noises to a variant of the Kalman filter. In light of this, we obtain relatively explicit lower bounds on the feedback capacity…

In this paper, the capacity of the additive white Gaussian noise (AWGN) channel, affected by time-varying Wiener phase noise is investigated. Tight upper and lower bounds on the capacity of this channel are developed. The upper bound is…

We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and…

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…

Variational quantum algorithms are tailored to perform within the constraints of current quantum devices, yet they are limited by performance-degrading errors. In this study, we consider a noise model that reflects realistic gate errors…

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

This paper provides an upper-bound for the capacity of the underwater acoustic (UWA) channel with dominant noise sources and generalized fading environments. Previous works have shown that UWA channel noise statistics are not necessary…