{"title":"Alphabet-size dependent bounds for exact repair in distributed storage","authors":"V. Cadambe, A. Mazumdar","doi":"10.1109/ITWF.2015.7360722","DOIUrl":null,"url":null,"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.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop - Fall (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWF.2015.7360722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
