{"title":"一类新的基于图的MDS擦除码","authors":"N. Puttarak, Phisan Kaewprapha, B. Ng, T. Li","doi":"10.1109/GLOCOM.2009.5426134","DOIUrl":null,"url":null,"abstract":"Maximum distance separable (MDS) array codes are XOR-based optimal erasure codes that are particularly suitable for use in disk arrays. This paper develops an innovative method to build MDS array codes from an elegant class of nested graphs, termed complete-graph-of-rings (CGR). We discuss a systematic and concrete way to transfer these graphs to array codes, unveil an interesting relation between the proposed map and the renowned perfect 1-factorization, and show that the proposed CGR codes subsume B-codes as their \"contracted\" codes. These new codes, termed CGR codes, and their dual codes are simple to describe, and require minimal encoding and decoding complexity.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"319 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Class of MDS Erasure Codes Based on Graphs\",\"authors\":\"N. Puttarak, Phisan Kaewprapha, B. Ng, T. Li\",\"doi\":\"10.1109/GLOCOM.2009.5426134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Maximum distance separable (MDS) array codes are XOR-based optimal erasure codes that are particularly suitable for use in disk arrays. This paper develops an innovative method to build MDS array codes from an elegant class of nested graphs, termed complete-graph-of-rings (CGR). We discuss a systematic and concrete way to transfer these graphs to array codes, unveil an interesting relation between the proposed map and the renowned perfect 1-factorization, and show that the proposed CGR codes subsume B-codes as their \\\"contracted\\\" codes. These new codes, termed CGR codes, and their dual codes are simple to describe, and require minimal encoding and decoding complexity.\",\"PeriodicalId\":405624,\"journal\":{\"name\":\"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference\",\"volume\":\"319 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2009.5426134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2009.5426134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Maximum distance separable (MDS) array codes are XOR-based optimal erasure codes that are particularly suitable for use in disk arrays. This paper develops an innovative method to build MDS array codes from an elegant class of nested graphs, termed complete-graph-of-rings (CGR). We discuss a systematic and concrete way to transfer these graphs to array codes, unveil an interesting relation between the proposed map and the renowned perfect 1-factorization, and show that the proposed CGR codes subsume B-codes as their "contracted" codes. These new codes, termed CGR codes, and their dual codes are simple to describe, and require minimal encoding and decoding complexity.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
