English
Related papers

Related papers: On the Achievable Rate and Capacity for a Sample-b…

200 papers

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

Surpassing the repeaterless bound is a crucial task on the way towards realizing long-distance quantum key distribution. In this paper, we focus on the protocol proposed by Azuma et al. in [Nature Communications 6, 10171 (2015)], which can…

Quantum Physics · Physics 2020-01-22 Róbert Trényi , Koji Azuma , Marcos Curty

Deep-space optical communication links operate under severely limited signal power, approaching the photon-starved regime which requires a receiver capable of measuring individual incoming photons. This makes the photon information…

Quantum Physics · Physics 2025-03-18 M. Jarzyna , L. Kunz , W. Zwolinski , M. Jachura , K. Banaszek

We study the discrete-time Poisson channel under the constraint that its average input power (in photons per channel use) must not exceed some constant E. We consider the wideband, high-photon-efficiency extreme where E approaches zero, and…

Information Theory · Computer Science 2014-04-25 Ligong Wang , Gregory W. Wornell

We derive improved and easily computable upper bounds on the capacity of the discrete-time Poisson channel under an average-power constraint and an arbitrary constant dark current term. This is accomplished by combining a general convex…

Information Theory · Computer Science 2020-11-03 Mahdi Cheraghchi , João Ribeiro

In this paper, a diffusion-based molecular communication channel between two nano-machines is considered. The effect of the amount of memory on performance is characterized, and a simple memory-limited decoder is proposed and its…

Biological Physics · Physics 2014-05-05 Reza Mosayebi , Hamidreza Arjmandi , Amin Gohari , Masoumeh Nasiri Kenari , Urbashi Mitra

The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of…

Quantum Physics · Physics 2022-07-13 Cillian Harney , Stefano Pirandola

This work considers a discrete-time Poisson noise channel with an input amplitude constraint $\mathsf{A}$ and a dark current parameter $\lambda$. It is known that the capacity-achieving distribution for this channel is discrete with…

Information Theory · Computer Science 2024-01-11 Luca Barletta , Alex Dytso , Shlomo Shamai

The secrecy rate represents the amount of information per unit time that can be securely sent on a communication link. In this work, we investigate the achievable secrecy rates in an energy harvesting communication system composed of a…

Information Theory · Computer Science 2016-11-17 Alessandro Biason , Nicola Laurenti , Michele Zorzi

This work considers the distribution of a secret key over an optical (bosonic) channel in the regime of high photon efficiency, i.e., when the number of secret key bits generated per detected photon is high. While in principle the photon…

Information Theory · Computer Science 2014-07-23 Yuval Kochman , Ligong Wang , Gregory W. Wornell

We first investigate two-user nonasymmetric sum-rate Poisson capacity with non-perfect photoncounting receiver under certain condition and demonstrate three possible transmission strategy, including only one active user and both active…

Information Theory · Computer Science 2021-06-10 Zhimeng Jiang , Chen Gong , Guanchu Wang , Zhengyuan Xu

We consider the problem, where a camera is tasked with determining one of two hypotheses: first with an incoherently-radiating quasi-monochromatic point source and the second with two identical closely spaced point sources. We are given…

Quantum Physics · Physics 2016-09-07 Hari Krovi , Saikat Guha , Jeffrey H. Shapiro

We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…

Information Theory · Computer Science 2019-04-10 Deekshith P K , K Gautam Shenoy , Vinod Sharma

When simultaneous wireless information and power transfer is carried out, a fundamental tradeoff between achievable rate and harvested energy exists because the received power is used for two different purposes. The tradeoff is well…

Information Theory · Computer Science 2018-02-06 Young-bin Kim , Dae Kyu Shin , Wan Choi

In this paper, we present new achievability bounds on the maximal achievable rate of variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC) at a fixed message size $M = 2^k$. We provide new bounds for VLSF…

Information Theory · Computer Science 2023-07-31 Hengjie Yang , Richard D. Wesel

New capacity upper bounds are presented for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed for the seemingly unrelated problem of upper…

Information Theory · Computer Science 2018-07-23 Mahdi Cheraghchi , João Ribeiro

Coherent states of light, and methods for distinguishing between them, are central to all applications of laser light. We obtain the ultimate quantum limit on the error probability exponent for discriminating among any M multimode…

Quantum Physics · Physics 2014-03-19 Ranjith Nair , Saikat Guha , Si-Hui Tan

We calculate numerically the capacity of a lossy photon channel assuming photon number resolving detection at the output. We consider scenarios of input Fock and coherent states ensembles and show that the latter always exhibits worse…

Quantum Physics · Physics 2021-08-30 Karol Łukanowski , Marcin Jarzyna

In physical-layer security, one of the most fundamental issues is the secrecy capacity. The objective of this paper is to determine the secrecy capacity for an indoor visible light communication system consisting of a transmitter, a…

Information Theory · Computer Science 2021-09-24 Jin-Yuan Wang , Xian-Tao Fu , Jun-Bo Wang , Min Lin , Julian Cheng , Mohamed-Slim Alouini

It is well known that ideal free-space optical communication at the quantum limit can have unbounded photon information efficiency (PIE), measured in bits per photon. High PIE comes at a price of low dimensional information efficiency…

Quantum Physics · Physics 2015-03-19 Sam Dolinar , Kevin M. Birnbaum , Baris I. Erkmen , Bruce Moision