Title
Shortened regenerating codes
Abstract
For general exact repair regenerating codes, the optimal trade-offs between the storage size and repair bandwidth remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument, we identify nonnegative differences between the functional repair and the exact repair outer bounds, and one of the differences is then bounded from below by the repair...
Year
DOI
Venue
2015
10.1109/TIT.2018.2840995
IEEE Transactions on Information Theory
Keywords
Field
DocType
Maintenance engineering,Upper bound,Entropy,Data collection,Bandwidth,Random variables,Distributed databases
Discrete mathematics,Combinatorics,Chain rule,Mathematics,Bounded function
Journal
Volume
Issue
ISSN
65
2
0018-9448
Citations 
PageRank 
References 
9
0.48
11
Authors
1
Name
Order
Citations
PageRank
Iwan M. Duursma127926.85