Paper Info
Title
Optimal Pliable Fractional Repetition Codes That are Locally Recoverable: A Bipartite Graph Approach.
Abstract
The main purpose of this paper is to construct pliable fractional repetition (FR) codes that are locally recoverable for distributed storage systems (DSSs). FR codes are integral in constructing a class of distributed storage codes with exact repair by transfer. Pliable FR codes are a new type of FR codes in which both the per-node storage and repetition degree can easily be adjusted simultaneousl...
Year
DOI
Venue
2019
10.1109/TIT.2018.2876284
IEEE Transactions on Information Theory
Keywords
Field
DocType
Maintenance engineering,Spread spectrum communication,Bipartite graph,Upper bound,Encoding,Periodic structures,Indexes
Discrete mathematics,Locality,Computer science,Upper and lower bounds,Load balancing (computing),Distributed data store,Bipartite graph,Direct-sequence spread spectrum,Encoding (memory),Spread spectrum
Journal
Volume
Issue
ISSN
65
2
0018-9448
Citations 
PageRank 
References 
2
0.36
0
Authors
1
Name
Order
Citations
PageRank
Yi-Sheng Su1488.42