Paper Info
Title
On Rate Region of Caching Problems With Non-Uniform File and Cache Sizes.
Abstract
Rate region of the caching problems with non-uniform file and cache sizes can be characterized in terms of the region of entropic vectors, which is unknown in general. One can replace the region of entropic vectors with its polyhedral outer bound to get the associated outer bound on the rate region. A new computation method is introduced for the calculation. The polyhedral projection is converted ...
Year
DOI
Venue
2017
10.1109/LCOMM.2016.2594762
IEEE Communications Letters
Keywords
Field
DocType
Network coding,Servers,Broadcasting,Linear programming,Encoding,Decoding,Entropy
Linear network coding,Approximation algorithm,Computer science,Cache,Binary code,Real-time computing,Linear programming,Decoding methods,Encoding (memory),Computation
Journal
Volume
Issue
ISSN
21
2
1089-7798
Citations 
PageRank 
References 
4
0.46
11
Authors
1
Name
Order
Citations
PageRank
Congduan Li1123.00