一种低修复带宽、低子分组化的高效承载设计

Zhengyi Jiang, Hanxu Hou, Y. Han, Zhongyi Huang, Bo Bai, Gong Zhang
{"title":"一种低修复带宽、低子分组化的高效承载设计","authors":"Zhengyi Jiang, Hanxu Hou, Y. Han, Zhongyi Huang, Bo Bai, Gong Zhang","doi":"10.1109/ISIT45174.2021.9518037","DOIUrl":null,"url":null,"abstract":"Piggybacking is a class of coding framework for MDS array codes that can achieve small repair bandwidth with small sub-packetization. An ($n, k, \\alpha$) piggybacking code can be represented by an $n\\times \\alpha$ array such that each node (row) stores $\\alpha$ symbols and any $k$ rows can retrieve all $k\\alpha$ data symbols. In this paper, we first propose a new piggybacking framework for MDS array codes with lower sub-packetization and then propose two specific piggybacking codes based on the proposed framework. We show that the average repair bandwidth of any single-node failure of our piggybacking codes is lower than all the existing piggybacking codes with the same parameters when the sub-packetization is small (usually $\\alpha\\leq 8$) and $n-k\\geq 10$.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Efficient Piggybacking Design with Lower Repair Bandwidth and Lower Sub-packetization\",\"authors\":\"Zhengyi Jiang, Hanxu Hou, Y. Han, Zhongyi Huang, Bo Bai, Gong Zhang\",\"doi\":\"10.1109/ISIT45174.2021.9518037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Piggybacking is a class of coding framework for MDS array codes that can achieve small repair bandwidth with small sub-packetization. An ($n, k, \\\\alpha$) piggybacking code can be represented by an $n\\\\times \\\\alpha$ array such that each node (row) stores $\\\\alpha$ symbols and any $k$ rows can retrieve all $k\\\\alpha$ data symbols. In this paper, we first propose a new piggybacking framework for MDS array codes with lower sub-packetization and then propose two specific piggybacking codes based on the proposed framework. We show that the average repair bandwidth of any single-node failure of our piggybacking codes is lower than all the existing piggybacking codes with the same parameters when the sub-packetization is small (usually $\\\\alpha\\\\leq 8$) and $n-k\\\\geq 10$.\",\"PeriodicalId\":299118,\"journal\":{\"name\":\"2021 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT45174.2021.9518037\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT45174.2021.9518037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

Piggybacking是一类MDS阵列码的编码框架,可以实现小的修复带宽和小的子分组。($n, k, \alpha$)承载代码可以用$n\times \alpha$数组表示,这样每个节点(行)存储$\alpha$符号,任何$k$行都可以检索所有$k\alpha$数据符号。在本文中,我们首先提出了一种新的具有较低子分组的MDS阵列码的承载框架,然后在此框架的基础上提出了两种特定的承载代码。我们的研究表明,当子分组较小(通常为$\alpha\leq 8$)和$n-k\geq 10$时,我们的承载码的任何单节点故障的平均修复带宽都低于具有相同参数的所有现有承载码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Piggybacking Design with Lower Repair Bandwidth and Lower Sub-packetization
Piggybacking is a class of coding framework for MDS array codes that can achieve small repair bandwidth with small sub-packetization. An ($n, k, \alpha$) piggybacking code can be represented by an $n\times \alpha$ array such that each node (row) stores $\alpha$ symbols and any $k$ rows can retrieve all $k\alpha$ data symbols. In this paper, we first propose a new piggybacking framework for MDS array codes with lower sub-packetization and then propose two specific piggybacking codes based on the proposed framework. We show that the average repair bandwidth of any single-node failure of our piggybacking codes is lower than all the existing piggybacking codes with the same parameters when the sub-packetization is small (usually $\alpha\leq 8$) and $n-k\geq 10$.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信