English

Capacity Bounds for the Poisson-Repeat Channel

Information Theory 2024-10-04 v1 math.IT

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 λ\lambda (specifically, for λ0.35\lambda\ge 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.

Keywords

Cite

@article{arxiv.2410.02342,
  title  = {Capacity Bounds for the Poisson-Repeat Channel},
  author = {Mohammad Kazemi and Tolga M. Duman},
  journal= {arXiv preprint arXiv:2410.02342},
  year   = {2024}
}
R2 v1 2026-06-28T19:06:45.534Z