@inproceedings{642bca83ef4d4278909171b58edb89e9,
title = "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.",
author = "Viveck Cadambe and Arya Mazumdar",
note = "Funding Information: Arya Mazumdar's research is supported in parts by an NSF CAREER award CCF 1453121 and NSF grant CCF 1318093. Viveck Cadambe's research is supported partially by NSF award CCF 1464336. Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE Information Theory Workshop, ITW 2015 ; Conference date: 11-10-2015 Through 15-10-2015",
year = "2015",
month = dec,
day = "17",
doi = "10.1109/ITWF.2015.7360722",
language = "English (US)",
series = "ITW 2015 - 2015 IEEE Information Theory Workshop",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1--3",
booktitle = "ITW 2015 - 2015 IEEE Information Theory Workshop",
address = "United States",
}