RECORD
On Weak Dress Codes for Cloud Storage
Information Theory · Submitted 15 Feb 2013
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Finally we present a simple generalized ring construction of both strong and weak fractional repetition codes.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
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 $\rho$. Several constructions of FR codes based on regular graphs, resolvable designs and bipartite graphs are known. 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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | In a distributed storage network, reliability and bandwidth optimization can be provided by regenerating codes. | background 1.00 | 0.05 | 0.04 | asserted 0.84 |
| s1 | Recently table based regenerating codes viz. | background 1.00 | 0.05 | 0.02 | unclear 0.80 |
| s2 | DRESS (Distributed Replication-based Exact Simple Storage) codes has been proposed which also optimizes the disk I/O. | background 1.00 | 0.07 | 0.04 | asserted 1.00 |
| s3 | Dress codes consists of an outer MDS code with an inner fractional repetition (FR) code with replication degree $\rho$. | background 0.95 | 0.12 | 0.04 | asserted 1.00 |
| s4 | Several constructions of FR codes based on regular graphs, resolvable designs and bipartite graphs are known. | background 1.00 | 0.05 | 0.03 | asserted 1.00 |
| s5 | This paper presents a simple modular construction of FR codes. | contribution 1.00 | 0.91 | 0.19 | asserted 1.00 |
| s6 | We also generalize the concept of FR codes to weak fractional repetition (WFR) codes where each node has different number of packets. | contribution 1.00 | 0.92 | 0.12 | asserted 1.00 |
| s7 | We present a construction of WFR codes based on partial regular graph. | contribution 0.90 | 0.93 | 0.12 | asserted 1.00 |
| s8 | Finally we present a simple generalized ring construction of both strong and weak fractional repetition codes. | contribution 0.99 | 0.94 | 0.26 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
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 $\rho$. Several constructions of FR codes based on regular graphs, resolvable designs and bipartite graphs are known. 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.
Human review
How the literature uses it
6 arXiv papers cite this in 8 sentences
Papers citing it · 2 sentences without a confident label
Cites it as background 5 papers
-
Generalization of FR codes to weak or general FR codes, where each node stores a different amount of symbols, and constructions of codes based on graphs and group divisible designs are considered in [ref] .
Optimal Fractional Repetition Codes based on Graphs and Designs · Introduction · 0.88
-
Gupta et al. [ref] introduce weak fractional repetition codes, where each storage node contains different number of packets.
HFR Code: A Flexible Replication Scheme for Cloud Storage Systems · Fractional Repetition Codes · 0.81
-
In [ref] , FR code with dynamic repair degree called Weak Fractional Repetition code (WFR code) is constructed by partial regular graph.
On Code Rates of Fractional Repetition Codes · Introduction · 0.89
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.