English
Related papers

Related papers: Asymptotics of Input-Constrained Erasure Channel C…

200 papers

We consider finite state channels where the state of the channel is its previous output. We refer to these as POST (Previous Output is the STate) channels. We first focus on POST($\alpha$) channels. These channels have binary inputs and…

Information Theory · Computer Science 2013-09-24 Haim H. Permuter , Himanshu Asnani , Tsachy Weissman

This paper investigates the asymptotic expansion for the size of block codes defined for the additive white Gaussian noise (AWGN) channel with feedback under the following setting: A peak power constraint is imposed on every transmitted…

Information Theory · Computer Science 2014-10-14 Silas L. Fong , Vincent Y. F. Tan

In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive…

Information Theory · Computer Science 2024-07-24 Sheng Yang , Richard Combes

Channels with synchronization errors, exhibiting deletion and insertion errors, find practical applications in DNA storage, data reconstruction, and various other domains. Presence of insertions and deletions render the channel with memory,…

Information Theory · Computer Science 2025-12-19 Busra Tegin , Tolga M Duman

We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we…

Quantum Physics · Physics 2020-09-15 Dawei Ding , Yihui Quek , Peter W. Shor , Mark M. Wilde

This paper studies the second-order asymptotics of the Gaussian multiple-access channel with degraded message sets. For a fixed average error probability $\varepsilon \in (0,1)$ and an arbitrary point on the boundary of the capacity region,…

Information Theory · Computer Science 2015-10-07 Jonathan Scarlett , Vincent Y. F. Tan

Worst-case models of erasure and symmetric channels are investigated, in which the number of channel errors occurring in each sliding window of a given length is bounded. Upper and lower bounds on their zero-error capacities are derived,…

Signal Processing · Electrical Eng. & Systems 2019-02-07 Amir Saberi , Farhad Farokhi , Girish N. Nair

We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…

Information Theory · Computer Science 2015-04-06 Tobias Sutter , David Sutter , Peyman Mohajerin Esfahani , John Lygeros

We consider spatially coupled code ensembles. A particular instance are convolutional LDPC ensembles. It was recently shown that, for transmission over the memoryless binary erasure channel, this coupling increases the belief propagation…

Information Theory · Computer Science 2011-02-03 Shrinivas Kudekar , Kenta Kasai

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

The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably simulated over the channel, using a deterministic coding…

Information Theory · Computer Science 2021-08-13 Assaf Ben-Yishai , Young-Han Kim , Or Ordentlich , Ofer Shayevitz

We investigate if feedback can increase the capacity of an energy harvesting communication channel where a transmitter powered by an exogenous energy arrival process and equipped with a finite battery communicates to a receiver over a…

Information Theory · Computer Science 2015-06-08 Dor Shaviv , Ayfer Ozgur , Haim Permuter

We calculate the quantum capacity of an amplitude-damping channel with time correlated Markov noise, for two channel uses. Our results show that memory of the channel increases it's ability to transmit quantum information significantly. We…

Quantum Physics · Physics 2017-07-03 Rabia Jahangir , Nigum Arshed , A. H. Toor

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

This paper introduces a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, this…

Information Theory · Computer Science 2015-06-16 Santhosh Kumar , Henry D. Pfister

We revisit the oblivious transfer (OT) capacities of noisy channels against the passive adversary, which have been identified only for a limited class of channels. In the literature, the general construction of oblivious transfer has been…

Information Theory · Computer Science 2024-01-29 So Suda , Shun Watanabe , Haruya Yamaguchi

There are currently a plurality of capacity theories of fading channels, including the ergodic capacity for fast fading channels and outage capacity for slow fading channels. However, analyses show that the outage capacity is a…

Information Theory · Computer Science 2019-04-01 Xuezhi Yang

In this paper we study quantum communication channels with correlated noise effects, i.e., quantum channels with memory. We derive a model for correlated noise channels that includes a channel memory state. We examine the case where the…

Quantum Physics · Physics 2009-11-10 Garry Bowen , Stefano Mancini

Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estimate of the channel is available that differs from the true…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Gerald Matz , Pierre Duhamel

Memoryless channels with deletion errors as defined by a stochastic channel matrix allowing for bit drop outs are considered in which transmitted bits are either independently deleted with probability $d$ or unchanged with probability…

Information Theory · Computer Science 2012-11-13 Mojtaba Rahmati , Tolga M. Duman