相关论文: Comments on "Capacity with explicit delay guarante…

We consider three capacity definitions for general channels with channel side information at the receiver, where the channel is modeled as a sequence of finite dimensional conditional distributions not necessarily stationary, ergodic, or…

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…

We develop bounds on the capacity of Poisson-repeat channels (PRCs) for which each input bit is independently repeated according to a Poisson distribution. The upper bounds are obtained by considering an auxiliary channel where the output…

This paper adresses the behaviour of the mutual information of correlated MIMO Rayleigh channels when the numbers of transmit and receive antennas converge to infinity at the same rate. Using a new and simple approach based on…

Capacity bounds for waveform channels under square-law detection of time-limited complex-valued signals are derived. The upper bound is the capacity of the channel under (complex-valued) coherent detection. The lower bound is one bit less,…

We derive a new Sequential-Monte-Carlo-based algorithm to estimate the capacity of two-dimensional channel models. The focus is on computing the noiseless capacity of the 2-D one-infinity run-length limited constrained channel, but the…

We find the capacity pre-log of a temporally correlated Rayleigh block-fading SIMO channel in the noncoherent setting. It is well known that for block-length L and rank of the channel covariance matrix equal to Q, the capacity pre-log in…

For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum achievable expected rate for coding over a finite number of coherent blocks represents a fundamental measure of the…

The randomized fixe-composition with optimal decoding error exponents are studied \cite{Raul_ISIT,Raul_journal} for the finite alphabet interference channel (IFC) with two transmitter-receiver pairs. In this paper we investigate the…

The traditional notion of capacity studied in the context of memoryless network communication builds on the concept of block-codes and requires that, for sufficiently large blocklength n, all receiver nodes simultaneously decode their…

We consider transmission over a wireless multiple antenna communication system operating in a Rayleigh flat fading environment with no channel state information at the receiver and the transmitter with coherence time T=1. We show that,…

We construct a channel coding scheme to achieve the capacity of any discrete memoryless channel based solely on the techniques of polar coding. In particular, we show how source polarization and randomness extraction via polarization can be…

We investigate the quantum capacity of noisy quantum channels which can be represented by coupling a system to an effectively small environment. A capacity formula is derived for all cases where both system and environment are…

Reservoir Computing (RC) is a bio-inspired machine learning framework, and various models have been proposed. RC is a well-suited model for time series data processing, but there is a trade-off between memory capacity and nonlinearity. In…

Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length $n$ such that the error probability goes to zero as $n$ goes to infinity. In this definition, it is implicit that the block…

The exact order of the optimal sub-exponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryless channel with and without ideal feedback is determined.…

In most studies of the channel capacity of quantum channels, it is assumed that the errors in each use of the channel are independent. However, recent work has begun to investigate the effects of memory or correlations in the error. This…

We find a strong-converse bound on the private capacity of a quantum channel assisted by unlimited two-way classical communication. The bound is based on the max-relative entropy of entanglement and its proof uses a new inequality for the…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

Channel capacity bounds are derived for a point-to-point indoor visible light communications (VLC) system with signal-dependent Gaussian noise. Considering both illumination and communication, the non-negative input of VLC is constrained by…