具有联合信息局部性的最优二进制局部可修码

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI:10.1109/ITWF.2015.7360733

Junghyun Kim, Mi-Young Nam, Hong‐Yeop Song

{"title":"具有联合信息局部性的最优二进制局部可修码","authors":"Junghyun Kim, Mi-Young Nam, Hong‐Yeop Song","doi":"10.1109/ITWF.2015.7360733","DOIUrl":null,"url":null,"abstract":"We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r1, r2)i = (2, 3) and (r1, r2)i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Optimal binary locally repairable codes with joint information locality\",\"authors\":\"Junghyun Kim, Mi-Young Nam, Hong‐Yeop Song\",\"doi\":\"10.1109/ITWF.2015.7360733\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r1, r2)i = (2, 3) and (r1, r2)i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.\",\"PeriodicalId\":281890,\"journal\":{\"name\":\"2015 IEEE Information Theory Workshop - Fall (ITW)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Information Theory Workshop - Fall (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWF.2015.7360733\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop - Fall (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWF.2015.7360733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

我们提出了新的最优二进制局部可修复码族，称为冠码和环码，它们分别在联合信息局域(r1, r2)i =(2,3)和(r1, r2)i =(2,4)时达到最优码率。联合信息局部是一组用于修复信息符号的各种擦除模式的符号数。我们利用简单图简化了代码设计问题，并指出图的特殊结构提供了良好的局部性。

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

查看原文本刊更多论文

Optimal binary locally repairable codes with joint information locality

We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r1, r2)i = (2, 3) and (r1, r2)i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.

求助全文

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

来源期刊

2015 IEEE Information Theory Workshop - Fall (ITW)

自引率

0.00%

发文量