On the Capacity of the Discrete-Time Poisson Channel
From MaRDI portal
Publication:4975698
DOI10.1109/TIT.2008.2008121zbMATH Open1367.94162OpenAlexW2167949116MaRDI QIDQ4975698FDOQ4975698
Authors: Amos Lapidoth, Stefan M. Moser
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.2008121
Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)
Cited In (8)
- The Vector Poisson Channel: On the Linearity of the Conditional Mean Estimator
- On the Capacity Bounds for Poisson Interference Channels
- Transmission of a Bit Over a Discrete Poisson Channel With Memory
- Capacity of the L/sub p/ norm-constrained Poisson channel
- Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel
- The Degraded Poisson Wiretap Channel
- Information-Theoretic Foundations of DNA Data Storage
- On the sphere-packing bound, capacity, and similar results for Poisson channels
This page was built for publication: On the Capacity of the Discrete-Time Poisson Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975698)