Backend
Finite-Support Structure of Optimal i.i.d. Inputs for Finite-Memory Poisson Channels
arXiv math.IT0 views
arXiv:2607.22234v2 Announce Type: replace Abstract: Discrete-time Poisson channels with finite intersymbol interference provide a natural model for direct-detection optical links in which multipath memory and signal-dependent shot noise appear simultaneously. Under peak and average optical-intensity constraints, we study the stationary mutual-information-rate optimization under an independent and identically distributed (i.i.d.) input restriction. We prove that every input distribution maximizing the stationary mutual information rate within the i.i.d. input class has finite support. The proof is carried out directly on the entropy rate of the continuous-state hidden Markov output process induced by the finite-memory channel. We first establish a filtering-forgetting estimate whose constants are uniform over all admissible i.i.d. input laws. We then derive the entropy-rate first variation, construct a holomorphic extension of the corresponding influence function, and combine the Karush-Kuhn-Tucker condition with a supralinear growth argument.
Source:https://arxiv.org/abs/2607.22234PreviousMultidimensional Reconciliation in Continuous-Variable QKD: Review, Coding Schemes, and Open-Source SimulationNextSolomonoff induction of selected bits and online classification
Related posts
Fast and Memory-Light Evaluation of Density-Based Clusterings with the DISCO Index in R
0arXiv stat.CO
Norm-equation methods for structured group-penalized regression
0arXiv stat.CO
Best New Roblox Games to Play and Explore This Month
0FOSS Bytes

Karpenter v1.15: GPU-aware provisioning, smarter node repair, and more
0AWS Containers Blog
Free Orlando, Florida Real Estate Dataset: 5231 Listings in Excel (2026-11-03)
0dev.to Data
I Asked Apple's Search API for 20 VPN Apps and Got 18. Asking for 200 Gets You 189
0dev.to Data