TitleGeneral Fractional Repetition Codes From Combinatorial Designs
AuthorsZhu, Bing
Li, Hui
Li, Shuo-Yen Robert
AffiliationPeking Univ, Sch Elect & Comp Engn, Shenzhen 518055, Peoples R China.
Peking Univ, Shenzhen Grad Sch, Inst Big Data Technol, Shenzhen Engn Lab Converged Networking Technol,Sh, Shenzhen 518055, Peoples R China.
Chinese Univ Hong Kong, Inst Network Coding, Hong Kong, Hong Kong, Peoples R China.
Univ Elect Sci & Technol China, Chengdu 611731, Sichuan, Peoples R China.
KeywordsHeterogenous storage system
general fractional repetition code
repair bandwidth
combinatorial designs
DISTRIBUTED STORAGE-SYSTEMS
LOCALITY
REPAIR
Issue Date2017
PublisherIEEE ACCESS
CitationIEEE ACCESS. 2017, 5, 26251-26256.
AbstractFractional repetition codes are a class of distributed storage codes dedicated to optimize the node repair performance, i.e., they enable uncoded exact repairs with minimum bandwidth consumption. Recent studies extend the application of such codes to heterogeneous storage networks, where the resultant codes are referred to as general fractional repetition (GFR) codes. In this paper, we propose some new constructions of GFR codes based on the combinatorial structures including packings, coverings, and pairwise balanced designs. Due to the mathematical properties of employed designs, the proposed constructions support a larger set of code parameters compared with existing construction methods.
URIhttp://hdl.handle.net/20.500.11897/501236
ISSN2169-3536
DOI10.1109/ACCESS.2017.2768799
IndexedSCI(E)
EI
Appears in Collections:信息工程学院

Files in This Work
There are no files associated with this item.

Web of Science®



Checked on Last Week

Scopus®



Checked on Current Time

百度学术™



Checked on Current Time

Google Scholar™





License: See PKU IR operational policies.