基于迭代矩阵的两类具有可用性的lrc

2020 13th International Symposium on Computational Intelligence and Design (ISCID) Pub Date : 2020-12-01 DOI:10.1109/ISCID51228.2020.00081

Mao Zhang, Ruihu Li

{"title":"基于迭代矩阵的两类具有可用性的lrc","authors":"Mao Zhang, Ruihu Li","doi":"10.1109/ISCID51228.2020.00081","DOIUrl":null,"url":null,"abstract":"Locally repairable code (LRC) in distributed storage system decreases repair degree of failed nodes. LRC with availability is extremely desired in distributed storage system because it permits local repair of failed nodes and parallel access of hot data. In this paper, a novel construction of LRCs with availability is proposed. Explicitly, by matrix iteration, two families of LRCs with all symbol locality and availability are constructed. The first family LRC is SA-LRC and keeps the code structure binary which is convenient to apply. The second family LRC is systematic code and possesses inspiring information rate $\\frac{r}{{r + 2}}$. Our construction is concise and explicit parity-check matrices of LRCs are given.","PeriodicalId":236797,"journal":{"name":"2020 13th International Symposium on Computational Intelligence and Design (ISCID)","volume":"230 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Two families of LRCs with availability based on iterative matrix\",\"authors\":\"Mao Zhang, Ruihu Li\",\"doi\":\"10.1109/ISCID51228.2020.00081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Locally repairable code (LRC) in distributed storage system decreases repair degree of failed nodes. LRC with availability is extremely desired in distributed storage system because it permits local repair of failed nodes and parallel access of hot data. In this paper, a novel construction of LRCs with availability is proposed. Explicitly, by matrix iteration, two families of LRCs with all symbol locality and availability are constructed. The first family LRC is SA-LRC and keeps the code structure binary which is convenient to apply. The second family LRC is systematic code and possesses inspiring information rate $\\\\frac{r}{{r + 2}}$. Our construction is concise and explicit parity-check matrices of LRCs are given.\",\"PeriodicalId\":236797,\"journal\":{\"name\":\"2020 13th International Symposium on Computational Intelligence and Design (ISCID)\",\"volume\":\"230 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 13th International Symposium on Computational Intelligence and Design (ISCID)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID51228.2020.00081\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 13th International Symposium on Computational Intelligence and Design (ISCID)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID51228.2020.00081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

分布式存储系统中的局部可修复代码(LRC)降低了故障节点的修复程度。具有可用性的LRC在分布式存储系统中是非常需要的，因为它允许故障节点的本地修复和热数据的并行访问。本文提出了一种新的具有可用性的lrc结构。明确地，通过矩阵迭代，构造了两个具有所有符号局部性和可用性的lrc族。第一族LRC是SA-LRC，其代码结构为二进制，便于应用。第二族LRC是系统码，具有激励信息率$\frac{r}{{r + 2}}$。我们的构造简洁明了，并给出了lrc的显式奇偶校验矩阵。

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

查看原文本刊更多论文

Two families of LRCs with availability based on iterative matrix

Locally repairable code (LRC) in distributed storage system decreases repair degree of failed nodes. LRC with availability is extremely desired in distributed storage system because it permits local repair of failed nodes and parallel access of hot data. In this paper, a novel construction of LRCs with availability is proposed. Explicitly, by matrix iteration, two families of LRCs with all symbol locality and availability are constructed. The first family LRC is SA-LRC and keeps the code structure binary which is convenient to apply. The second family LRC is systematic code and possesses inspiring information rate $\frac{r}{{r + 2}}$. Our construction is concise and explicit parity-check matrices of LRCs are given.

求助全文

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

来源期刊

2020 13th International Symposium on Computational Intelligence and Design (ISCID)

自引率

0.00%

发文量