Abstract
We introduce the Poisson matching lemma and apply it to prove one-shot achievability results for channels with state information at the encoder, lossy source coding with side information at the decoder, joint source-channel coding, broadcast channels, and distributed lossy source coding. Our one-shot bounds improve upon the best known bounds in the aforementioned settings, with shorter proofs in some settings even when compared to the conventional asymptotic typicality approach. The Poisson matching lemma replaces both the packing and covering lemmas. This paper extends the work of Li and El Gamal on Poisson functional representation for variable-length source coding settings, showing that the Poisson functional representation is a viable alternative to typicality for most problems in network information theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
