Fractional Repetition Codes Construction Based on Spanning Trees of Harary Graph

doi:10.15888/j.cnki.csa.007848

WeChat

Mobile website

Home > Archive>Volume 30, Issue 4, 2021 >241-246. DOI:10.15888/j.cnki.csa.007848

PDF HTML XML Export Cite reminder

Fractional Repetition Codes Construction Based on Spanning Trees of Harary Graph
DOI:
                        10.15888/j.cnki.csa.007848
                    
CSTR:
                        [cstr]
                    
Author:
                        
                        
                    
Affiliation:
Clc Number:
Fund Project:

Article

Figures

Metrics

Reference

Cited by

Materials

Comments

Abstract:

Aiming at the low efficiency in repairing failed nodes of fractional repetition codes, this study proposed a construction algorithm of Fractional Repetition codes based on Spanning trees of Harary graph (FRSH). As a result, FRSH codes have lower computational overhead in repairing bandwidth overhead and locality than RS codes and SRC. Besides, FRSH codes are more efficient and spend less time in repairing failed nodes, compared with the other two codes.

Reference

Cited by

Get Citation

张鑫楠,沈克勤,孙伟,何亚锦.基于Harary图生成树的部分重复码构造.计算机系统应用,2021,30(4):241-246

Copy

Article Metrics

Abstract:
PDF:
HTML:
Cited by:

History

Received:August 10,2020
Revised:August 28,2020
Adopted:
Online: March 31,2021
Published:

Article QR Code

You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address：4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code：100190
Phone：010-62661041 Fax： Email：csa (a) iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063