Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands

DOI10.1109/TIT.2019.2946361zbMath1433.94163arXiv1804.00807OpenAlexW2980086582MaRDI QIDQ5211624

Lutz Lampe, Seyed Ali Saberali, Ian F. Blake

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/1804.00807

Mathematics Subject Classification ID

Convex programming (90C25) Applications of design theory to circuits and networks (94C30) Measures of information, entropy (94A17)

This page was built for publication: Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands