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}
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$.