Capacity bounds for the Poisson-repeat channel
File(s)
Accepted version
Author(s)
Kazemi, Mohammad
Duman, Tolga M
Type
Conference Paper
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.
Date Issued
2023-08-22
Date Acceptance
2023-06-01
Citation
2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp.1196-1201
ISSN
2157-8095
Publisher
IEEE
Start Page
1196
End Page
1201
Journal / Book Title
2023 IEEE International Symposium on Information Theory (ISIT)
Volume
2023-June
Copyright Statement
Copyright © 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Source
2023 IEEE International Symposium on Information Theory (ISIT)
Publication Status
Published
Start Date
2023-06-25
Finish Date
2023-06-30
Coverage Spatial
Taipei, Taiwan