On Weak Dress Codes for Cloud Storage [article]

Manish K Gupta and Anupam Agrawal and Deepak Yadav
<span title="2013-02-15">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In a distributed storage network, reliability and bandwidth optimization can be provided by regenerating codes. Recently table based regenerating codes viz. DRESS (Distributed Replication-based Exact Simple Storage) codes has been proposed which also optimizes the disk I/O. Dress codes consists of an outer MDS code with an inner fractional repetition (FR) code with replication degree ρ. Several constructions of FR codes based on regular graphs, resolvable designs and bipartite graphs are known.
more &raquo; ... This paper presents a simple modular construction of FR codes. We also generalize the concept of FR codes to weak fractional repetition (WFR) codes where each node has different number of packets. We present a construction of WFR codes based on partial regular graph. Finally we present a simple generalized ring construction of both strong and weak fractional repetition codes.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1302.3681v1">arXiv:1302.3681v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fccoze43nvaffe7r2e3nn2yjue">fatcat:fccoze43nvaffe7r2e3nn2yjue</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1302.3681/1302.3681.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1302.3681v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>