Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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• 7 citations
arXivHTMLPDF

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.06061•IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2021•20 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.14792•IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•12 citations

A new upperbound for the oblivious transfer capacity of discrete memoryless channels

K. Sankeerth Rao, Vinod M. Prabhakaran

We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels (DMCs). The main tool we use is the tension region of a pair of random variables introduced in Prabhakaran and Prabhakaran (2014) where it was used to derive upper bounds on rates of secure sampling in the source model. In this paper, we consider secure computation of string oblivious transfer in the channel model. Our bound is based on a monotonicity property of the tension region in the channel model. We show that our bound strictly improves upon the upper bound of Ahlswede and Csiszár (2013).

arXiv:1405.2049•IEEE Information Theory Workshop (ITW)•Nov 1, 2014•9 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, 2018•14 citations

Improvement of Gallager Upper Bound and its Variations for Discrete Channels

Kostis Xenoulis, N. Kalouptsidis

A new tight upper bound on the maximum-likelihood (ML) word and bit-error decoding probabilities for specific codes over discrete channels is presented. It constitutes an enhanced version of the Gallager upper bound and its variations resulting from the Duman-Salehi second bounding technique. An efficient technique is developed that, in the case of symmetric channels, overcomes the difficulties associated with the direct computation of the proposed bound. Surprisingly, apart from the distance and input-output weight enumerating functions (IOWEFs), the bound depends also on the coset weight distribution of the code.

IEEE Transactions on Information Theory•Aug 24, 2009•1 citation

Information-theoretic aspects of optical communications

Ligong Wang

This dissertation studies several information-theoretic aspects of optical communications.The first aspect it studies is the one-shot classical capacity of a quantum communication channel.It proves new upper and lower bounds on the amount of classical information that can be transmitted through a single use of a quantum channel, under a constraint on the average error probability.The bounds are expressed using a quantity defined via quantum hypothesis testing.Combined with the Quantum Stein's Lemma, these bounds provide a conceptually simple proof for the Holevo-Schumacher-Westmoreland Theorem for the classical capacity of a memoryless quantum channel.Further, they also give a general capacity formula that is valid for any, not necessarily memoryless, quantum channel.The second topic studied in this dissertation is the capacity of a continuous-time peak-limited Poisson channel with spurious counts in the output.It is shown that, if the positions of the spurious counts are known noncausally to the encoder but not to the decoder, then the capacity of this channel equals the capacity of the same channel but with no spurious counts, regardless of whether the spurious counts are random or are chosen by a malicious adversary.On the other hand, if the positions of the spurious counts are known only causally to the encoder but not to the decoder, then such information does not help to increase the capacity of this channel.Next, a rate-distortion problem for point processes is considered.In this problem, an encoder sees a point pattern on the interval [0, T ] and v vi Abstract describes it to a reconstructor using bits.Based on this description, the reconstructor produces a subset of [0, T ] of Lebesgue measure not exceeding DT for some D > 0 to cover all the points in the pattern.It is shown that, if the point pattern is the outcome of a homogeneous Poisson process of intensity λ, then, as T tends to infinity, the minimum number of bits per second needed for the encoder to describe the pattern is -λ log D. Further, any point pattern containing no more than λ points per second can be successfully described in this sense using -λ log D bits per second.A Wyner-Ziv version of this problem is also studied where some points in the pattern are known to the reconstructor.The last problem considered in this dissertation is the asymptotic capacity at low input powers of a discrete-time Poisson channel under average-power or average-and peak-power constraints.For a Poisson channel whose dark current is zero or decays to zero linearly with the allowed average input power E, capacity is shown to scale like E log 1E as E tends to zero.For a Poisson channel whose dark current is a nonzero constant, capacity is shown to scale, to within a constant, like E log log 1 E .

•Jan 1, 2011•2 citations
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.
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.
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.
We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels (DMCs). The main tool we use is the tension region of a pair of random variables introduced in Prabhakaran and Prabhakaran (2014) where it was used to derive upper bounds on rates of secure sampling in the source model. In this paper, we consider secure computation of string oblivious transfer in the channel model. Our bound is based on a monotonicity property of the tension region in the channel model. We show that our bound strictly improves upon the upper bound of Ahlswede and Csiszár (2013).
A new tight upper bound on the maximum-likelihood (ML) word and bit-error decoding probabilities for specific codes over discrete channels is presented. It constitutes an enhanced version of the Gallager upper bound and its variations resulting from the Duman-Salehi second bounding technique. An efficient technique is developed that, in the case of symmetric channels, overcomes the difficulties associated with the direct computation of the proposed bound. Surprisingly, apart from the distance and input-output weight enumerating functions (IOWEFs), the bound depends also on the coset weight distribution of the code.
This dissertation studies several information-theoretic aspects of optical communications.The first aspect it studies is the one-shot classical capacity of a quantum communication channel.It proves new upper and lower bounds on the amount of classical information that can be transmitted through a single use of a quantum channel, under a constraint on the average error probability.The bounds are expressed using a quantity defined via quantum hypothesis testing.Combined with the Quantum Stein's Lemma, these bounds provide a conceptually simple proof for the Holevo-Schumacher-Westmoreland Theorem for the classical capacity of a memoryless quantum channel.Further, they also give a general capacity formula that is valid for any, not necessarily memoryless, quantum channel.The second topic studied in this dissertation is the capacity of a continuous-time peak-limited Poisson channel with spurious counts in the output.It is shown that, if the positions of the spurious counts are known noncausally to the encoder but not to the decoder, then the capacity of this channel equals the capacity of the same channel but with no spurious counts, regardless of whether the spurious counts are random or are chosen by a malicious adversary.On the other hand, if the positions of the spurious counts are known only causally to the encoder but not to the decoder, then such information does not help to increase the capacity of this channel.Next, a rate-distortion problem for point processes is considered.In this problem, an encoder sees a point pattern on the interval [0, T ] and v vi Abstract describes it to a reconstructor using bits.Based on this description, the reconstructor produces a subset of [0, T ] of Lebesgue measure not exceeding DT for some D > 0 to cover all the points in the pattern.It is shown that, if the point pattern is the outcome of a homogeneous Poisson process of intensity λ, then, as T tends to infinity, the minimum number of bits per second needed for the encoder to describe the pattern is -λ log D. Further, any point pattern containing no more than λ points per second can be successfully described in this sense using -λ log D bits per second.A Wyner-Ziv version of this problem is also studied where some points in the pattern are known to the reconstructor.The last problem considered in this dissertation is the asymptotic capacity at low input powers of a discrete-time Poisson channel under average-power or average-and peak-power constraints.For a Poisson channel whose dark current is zero or decays to zero linearly with the allowed average input power E, capacity is shown to scale like E log 1E as E tends to zero.For a Poisson channel whose dark current is a nonzero constant, capacity is shown to scale, to within a constant, like E log log 1 E .