Title :
Alphabet-size dependent bounds for exact repair in distributed storage
Author :
Viveck Cadambe;Arya Mazumdar
Author_Institution :
Department of Electrical Engineering, Pennsylvania State University, University Park, 16802, United States of America
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.
Keywords :
"Maintenance engineering","Bandwidth","Conferences","Linear codes","Electronic mail","Minimization"
Conference_Titel :
Information Theory Workshop - Fall (ITW), 2015 IEEE
DOI :
10.1109/ITWF.2015.7360722
