距离为5的显式最优长度局部可修码

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI:10.1109/ALLERTON.2018.8636018

Allison Beemer, Ryan Coatney, V. Guruswami, Hiram H. López, Fernando L. Piñero

{"title":"距离为5的显式最优长度局部可修码","authors":"Allison Beemer, Ryan Coatney, V. Guruswami, Hiram H. López, Fernando L. Piñero","doi":"10.1109/ALLERTON.2018.8636018","DOIUrl":null,"url":null,"abstract":"Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs oer the ideal trade-o between minimum distance and locality, a measure of the cost of repairing a single codeword symbol. For optimal LRCs with minimum distance greater than or equal to 5, block length is bounded by a polynomial function of alphabet size. In this paper, we give explicit constructions of optimal-length (in terms of alphabet size), optimal LRCs with minimum distance equal to 5.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Explicit optimal-length locally repairable codes of distance 5\",\"authors\":\"Allison Beemer, Ryan Coatney, V. Guruswami, Hiram H. López, Fernando L. Piñero\",\"doi\":\"10.1109/ALLERTON.2018.8636018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs oer the ideal trade-o between minimum distance and locality, a measure of the cost of repairing a single codeword symbol. For optimal LRCs with minimum distance greater than or equal to 5, block length is bounded by a polynomial function of alphabet size. In this paper, we give explicit constructions of optimal-length (in terms of alphabet size), optimal LRCs with minimum distance equal to 5.\",\"PeriodicalId\":299280,\"journal\":{\"name\":\"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2018.8636018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2018.8636018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

局部可修复代码(lrc)作为一种设计数据存储系统的方法，近年来受到了广泛的关注。最优lrc是在最小距离和局域性(修复单个码字符号的成本的度量)之间的理想权衡。对于最小距离大于等于5的最优lrc，块长度以字母大小的多项式函数为界。在本文中，我们给出了最优长度(根据字母大小)的显式结构，最小距离等于5的最优lrc。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Explicit optimal-length locally repairable codes of distance 5

Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs oer the ideal trade-o between minimum distance and locality, a measure of the cost of repairing a single codeword symbol. For optimal LRCs with minimum distance greater than or equal to 5, block length is bounded by a polynomial function of alphabet size. In this paper, we give explicit constructions of optimal-length (in terms of alphabet size), optimal LRCs with minimum distance equal to 5.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

自引率

0.00%

发文量