CSpace  > 系统科学研究所
An Integer Programming-Based Bound for Locally Repairable Codes
Wang, Anyu1; Zhang, Zhifang2
2015-10-01
Source PublicationIEEE TRANSACTIONS ON INFORMATION THEORY
ISSN0018-9448
Volume61Issue:10Pages:5280-5294
AbstractThe locally repairable code (LRC) studied in this paper is an right perpendicularn, kleft perpendicular linear code of which the value at each coordinate can be recovered by a linear combination of at most r other coordinates. The central problem in this paper is to determine the largest possible minimum distance for LRCs. First, an integer programming- based upper bound is derived for any LRC. Then, by solving the programming problem under certain conditions, an explicit upper bound is obtained for LRCs with parameters n(1) > n(2), where n(1) = right perpendicular(n/r + 1)left perpendicular and n(2) = n(1)(r+1)-n. Finally, an explicit construction for LRCs attaining this upper bound is presented over the finite field F(2)m, where m >= n(1)r. Based on these results, the largest possible minimum distance for all LRCs with r <= root n - 1 has been definitely determined, which is of great significance in practical use.
KeywordDistributed storage erasure codes locally repairable codes linear codes
DOI10.1109/TIT.2015.2472515
Language英语
Funding ProjectNational Key Basic Research Project of China[2011CB302400] ; National Science Foundation of China[61379139] ; Strategic Priority Research Program through the Chinese Academy of Sciences[XDA06010701] ; National Natural Science Foundation of China[61121062/F02] ; 973 Project[2011CB302401]
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Information Systems ; Engineering, Electrical & Electronic
WOS IDWOS:000361486800004
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation statistics
Cited Times:18[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/20762
Collection系统科学研究所
Affiliation1.Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
2.Chinese Acad Sci, AMSS, NCMIS, Key Lab Math Mechanizat, Beijing 100190, Peoples R China
Recommended Citation
GB/T 7714
Wang, Anyu,Zhang, Zhifang. An Integer Programming-Based Bound for Locally Repairable Codes[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2015,61(10):5280-5294.
APA Wang, Anyu,&Zhang, Zhifang.(2015).An Integer Programming-Based Bound for Locally Repairable Codes.IEEE TRANSACTIONS ON INFORMATION THEORY,61(10),5280-5294.
MLA Wang, Anyu,et al."An Integer Programming-Based Bound for Locally Repairable Codes".IEEE TRANSACTIONS ON INFORMATION THEORY 61.10(2015):5280-5294.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wang, Anyu]'s Articles
[Zhang, Zhifang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wang, Anyu]'s Articles
[Zhang, Zhifang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wang, Anyu]'s Articles
[Zhang, Zhifang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.