arXiv:1801.02745 · IEEE International Symposium on Information Theory (ISIT)

Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel

Mahdi Cheraghchi, João Ribeiro

Published Jun 1, 2018• 8 citations

Abstract

We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the average-power constraint does not approach zero was due to Martinez (JOSA B, 2007), which we re-derive as a special case of our framework. Furthermore, we instantiate our framework to obtain a closed-form bound that noticeably improves the result of Martinez everywhere.

DOI: 10.1109/isit.2018.8437514

Related papers

Deterministic Identification Over Poisson Channels

Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche +2 more

Deterministic identification (DI) for the discrete-time Poisson channel, subject to an average and a peak power constraint, is considered. It is established that the code size scales as 2(nlogn)R, where n and R are the block length and coding rate, respectively. The authors have recently shown a similar property for Gaussian channels [1]. Lower and upper bounds on the DI capacity of the Poisson channel are developed in this scale. Those imply that the DI capacity is infinite in the exponential scale, regardless of the dark current, i.e., the channel noise parameter.

arXiv:2107.06061IEEE Globecom Workshops (GC Wkshps)Dec 1, 202116 citations

Capacity Bounds for Identification With Effective Secrecy

Johannes Rosenberger, Abdalla Ibrahim, Boulat A. Bash +3 more

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound is improved by applying it to a prefix channel, formed by concatenating an auxiliary channel and the actual channel. The bounds are tight if the legitimate channel is more capable than the eavesdropper’s channel. An illustrative example is provided for a wiretap channel that is composed of a point-to-point channel, and a parallel, reversely degraded wiretap channel. A comparison with results for message transmission and for identification with only secrecy constraint is provided.

arXiv:2306.14792IEEE International Symposium on Information Theory (ISIT)Jun 25, 202311 citations

Potential Capacities of Quantum Channels

Andreas Winter, Dong Yang

We introduce potential capacities of quantum channels in an operational way and provide upper bounds for these quantities, which quantify the ultimate limit of usefulness of a channel for a given task in the best possible context. Unfortunately, except for a few isolated cases, potential capacities seem to be as hard to compute as their plain analogues. We thus study upper bounds on some potential capacities. For the classical capacity, we give an upper bound in terms of the entanglement of formation. To establish a bound for the quantum and private capacity, we first lift the channel to a Hadamard channel and then prove that the quantum and private capacity of a Hadamard channel is strongly additive, implying that for these channels, potential and plain capacity are equal. Employing these upper bounds, we show that if a channel is noisy, however close it is to the noiseless channel, then it cannot be activated into the noiseless channel by any other contextual channel; this conclusion holds for all the three capacities. We also discuss the so-called environment-assisted quantum capacity, because we are able to characterize its potential version.

arXiv:1505.00907IEEE Transactions on Information TheoryJan 21, 201637 citations

The Continuous-Time Poisson Channel Has Infinite Covert Communication Capacity

Ligong Wang

We consider the problem of communication over a continuous-time, infinite-bandwidth Poisson channel without peak-power constraint, but subject to a covertness constraint: the relative entropy between the output distributions when a codeword is transmitted and when no input is provided to the channel must tend to zero as total communication time grows large. We show that, under such a constraint, the capacity of this channel, in nats per second, is infinity.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 201813 citations

Improved Bounds on the Interactive Capacity via Error Pattern Analysis

Mudit Aggarwal, Manuj Mukherjee

Any interactive protocol between a pair of parties can be reliably simulated in the presence of noise with a multiplicative overhead on the number of rounds (Schulman 1996). The reciprocal of the best (least) overhead is called the interactive capacity of the noisy channel. In this work, we present lower bounds on the interactive capacity of the binary erasure channel. Our lower bound improves the best-known bound due to Ben- Yishai et al. 2021 by roughly a factor of 1.75. The improvement is due to a tighter analysis of the correctness of the simulation protocol using error pattern analysis. More precisely, instead of using the well-known technique of bounding the least number of erasures needed to make the simulation fail, we identify and bound the probability of specific erasure patterns causing simulation failure. We remark that error pattern analysis can be useful in solving other problems involving stochastic noise, such as bounding the interactive capacity of different channels.

arXiv:2401.15355IEEE International Symposium on Information Theory (ISIT)Jul 7, 20241 citation

The Ladder of Spectral Gaps F; Channel Capacity and Rate Gap– A Convergence Theorem for Constraint Network Information Geometry

changzheng zhou, ZIQING zhou

Shannon’s channel coding theorem establishes the upper bound of reliable communication rate as the channel capacity C, while the rate R of practical codingschemes is usually strictly lower than C, and the difference between them constitutes the rate gap. Within the framework of constraint network informationgeometry, this paper encodes a discrete memoryless channel and a linear blockcode as a channel constraint network and a coding constraint network respectively,and proposes to strictly define the information dimension by the volume growthrate of the rigid kernel under the Fisher information metric. The core conclusionshows that the Shannon gap C−R is asymptotically exactly equal to the logarithmnormalized limit of the ratio of Fisher volumes of the rigid kernels of the channelconstraint network and the coding constraint network, i.e., the difference of thevolume growth rates of the two networks. Under the local asymptotic normalitycondition, this gap satisfies L2 = 2(C −R)+O(n−1/2logn), where L is the squareof the Fisher geodesic distance. For the repetition code (3,1) over the binary symmetric channel, the analytical probability distributions of all eight output patternsare given, the finite-length deviation of the KL divergence from the asymptoticgap is computed, and its sources are analyzed. For the Hamming (7,4) code overthe binary erasure channel, by combinatorially enumerating all one hundred andtwenty-eight erasure patterns over finite fields, the average residual non-recoverabledimension and its deviation from the asymptotic prediction n(C −R) are preciselygiven, verifying the error bound O(1/√n). Finally, a roadmap is provided to extendthe volume compression framework to LDPC codes via the peeling algorithm andto Polar codes via the polarization transform, and the applicability boundaries ofthe current framework in the cases of asymmetric channels, continuous alphabets,and non-linear codes are honestly declared.

May 29, 20260 citations