Capacity Bounds for Networks With Correlated Sources and Characterisation of Distributions by Entropies
From MaRDI portal
Publication:5352602
DOI10.1109/TIT.2017.2681078zbMath1369.94414arXiv1607.02822OpenAlexW2477751107MaRDI QIDQ5352602
Terence H. Chan, Alex Grant, Satyajit Thakor
Publication date: 8 September 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.02822
Related Items (2)
Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Common information, matroid representation, and secret sharing for matroid ports
This page was built for publication: Capacity Bounds for Networks With Correlated Sources and Characterisation of Distributions by Entropies