Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
From MaRDI portal
Publication:5211452
DOI10.1109/TIT.2019.2920893zbMath1432.94090arXiv1708.05496OpenAlexW2973054652WikidataQ127762868 ScholiaQ127762868MaRDI QIDQ5211452
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.05496
Related Items (1)
This page was built for publication: Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems