The problem of lossless data compression with side information available to both the encoder and decoder is considered. finite-blocklength fundamental limits best achievable performance are defined, in two different versions problem: Reference-based compression, when a single string used repeatedly compressing source messages, pair-based where for each message. General achievability converse th...

In this paper, we analyze classical data compression with quantum side information (also known as the classical-quantum Slepian–Wolf protocol) in so-called large and moderate deviation regimes. non-asymptotic setting, protocol involves compressing sequences of finite length <tex-math notat...