English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper proposes a novel technique to prove a one-shot version ofachievability results in network information theory. The technique is not basedon covering and packing lemmas. In this technique, we use an stochastic encoderand decoder with a particular structure for coding that resembles both the MLand the joint-typicality coders. Although stochastic encoders and decoders donot usually enhance the capacity region, their use simplifies the analysis. TheJensen inequality lies at the heart of error analysis, which enables us to dealwith the expectation of many terms coming from stochastic encoders and decodersat once. The technique is illustrated via several examples: point-to-pointchannel coding, Gelfand-Pinsker, Broadcast channel (Marton), Berger-Tung,Heegard-Berger/Kaspi, Multiple description coding and Joint source-channelcoding over a MAC. Most of our one-shot results are new. The asymptotic formsof these expressions is the same as that of classical results. Our one-shotbounds in conjunction with multi-dimensional Berry-Essen CLT imply new resultsin the finite blocklength regime. In particular applying the one-shot resultfor the memoryless broadcast channel in the asymptotic case, we get the entireregion of Marton's inner bound without any need for time-sharing.

A Technique for Deriving One-Shot Achievability Results in Network Information Theory