Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2019.2920893
Abstract: In this paper, we revisit two multi-terminal lossy source coding problems: the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi… read more here.
Keywords: non asymptotic; source coding; problem; asymptotic converse ... See more keywords