Capacity Bounds for the Poisson-Repeat Channel

2024/10/03 by Kazemi, Mohammad, Duman, Tolga M.
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2410.02342

Abstract

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 lengths corresponding to input blocks of a given length are provided as side information at the receiver. Numerical results show that the resulting upper bounds are significantly tighter than the best known one for a large range of the PRC parameter λ (specifically, for λ≥ 0.35). We also describe a way of obtaining capacity lower bounds using information rates of the auxiliary channel and the entropy rate of the provided side information.

Related

• Structural Results and Improved Upper Bounds on the Capacity of the Discrete-Time Poisson Channel
• The Poisson Channel with Side Information
• Properties of the Support of the Capacity-Achieving Distribution of the Amplitude-Constrained Poisson Noise Channel
• Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels
• Transmission of a Bit over a Discrete Poisson Channel with Memory