{"title":"嵌套的擦除代码来实现单例边界","authors":"Phisan Kaewprapha, N. Puttarak, Jing Li","doi":"10.1109/CISS.2009.5054697","DOIUrl":null,"url":null,"abstract":"This paper presents innovative ideas to construct maximum distance separable (MDS) codes, optimal error correction codes that achieve the singleton bounds. The proposed codes are based on a circularly symmetric construction applied to a novel class of nested graphs, referred to as complete-graph-of-rings (CGR). We demonstrate the general idea of transforming graphs to array codes, provide the sufficient conditions for achieving MDS, and present the specific algorithms to construct CGR graphs and MDS-CGR codes. The new codes require minimal encoding and decoding complexity that is theoretically possible, and are particularly useful for disk array applications.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Nested erasure codes to achieve the singleton bounds\",\"authors\":\"Phisan Kaewprapha, N. Puttarak, Jing Li\",\"doi\":\"10.1109/CISS.2009.5054697\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents innovative ideas to construct maximum distance separable (MDS) codes, optimal error correction codes that achieve the singleton bounds. The proposed codes are based on a circularly symmetric construction applied to a novel class of nested graphs, referred to as complete-graph-of-rings (CGR). We demonstrate the general idea of transforming graphs to array codes, provide the sufficient conditions for achieving MDS, and present the specific algorithms to construct CGR graphs and MDS-CGR codes. The new codes require minimal encoding and decoding complexity that is theoretically possible, and are particularly useful for disk array applications.\",\"PeriodicalId\":433796,\"journal\":{\"name\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2009.5054697\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 43rd Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2009.5054697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Nested erasure codes to achieve the singleton bounds
This paper presents innovative ideas to construct maximum distance separable (MDS) codes, optimal error correction codes that achieve the singleton bounds. The proposed codes are based on a circularly symmetric construction applied to a novel class of nested graphs, referred to as complete-graph-of-rings (CGR). We demonstrate the general idea of transforming graphs to array codes, provide the sufficient conditions for achieving MDS, and present the specific algorithms to construct CGR graphs and MDS-CGR codes. The new codes require minimal encoding and decoding complexity that is theoretically possible, and are particularly useful for disk array applications.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
