Alphabet-size dependent bounds for exact repair in distributed storage

Abstract

We use some simple techniques to derive a universal alphabet-size dependent bound on the parameters of erasure-correcting regenerating codes. It can be shown that the well-known previous bounds are special cases of our more general bound. In certain cases our bound leads to improvement over prior results.