2015/05/01 by Iwan M. Duursma, Duursma, Iwan M.
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1505.00178
11 pages
arxiv created 2015/05/01 · arxiv updated 2015/05/04
For general exact repair regenerating codes, the optimal trade-offs between storage size and repair bandwith 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. One of the differences is then bounded from below by the repair data of a shortened subcode. Our main result is a new outer bound for an exact repair regenerating code in terms of its shortened subcodes. In general the new outer bound is implicit and depends on the choice of shortened subcodes. For the linear case we obtain explicit bounds.