{"title":"加比都林码的擦除译码算法的评价","authors":"Ricardo Bohaczuk Venturelli, Danilo Silva","doi":"10.1109/ITS.2014.6947968","DOIUrl":null,"url":null,"abstract":"Gabidulin codes are linear block codes over an extension field that can be seen as the analogs of Reed-Solomon codes for the rank metric. Important applications of Gabidulin codes include the areas of network coding and distributed storage, particularly for the problem of rank erasure correction. This paper studies the complexity of erasure decoding algorithms for Gabidulin codes with short-to-moderate (not asymptotically long) block lengths. The two fastest known algorithms are compared in detail (in terms of exact number of operations) and it is shown for which parameter values one algorithm is superior to the other.","PeriodicalId":359348,"journal":{"name":"2014 International Telecommunications Symposium (ITS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An evaluation of erasure decoding algorithms for Gabidulin codes\",\"authors\":\"Ricardo Bohaczuk Venturelli, Danilo Silva\",\"doi\":\"10.1109/ITS.2014.6947968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Gabidulin codes are linear block codes over an extension field that can be seen as the analogs of Reed-Solomon codes for the rank metric. Important applications of Gabidulin codes include the areas of network coding and distributed storage, particularly for the problem of rank erasure correction. This paper studies the complexity of erasure decoding algorithms for Gabidulin codes with short-to-moderate (not asymptotically long) block lengths. The two fastest known algorithms are compared in detail (in terms of exact number of operations) and it is shown for which parameter values one algorithm is superior to the other.\",\"PeriodicalId\":359348,\"journal\":{\"name\":\"2014 International Telecommunications Symposium (ITS)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Telecommunications Symposium (ITS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITS.2014.6947968\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Telecommunications Symposium (ITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.2014.6947968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An evaluation of erasure decoding algorithms for Gabidulin codes
Gabidulin codes are linear block codes over an extension field that can be seen as the analogs of Reed-Solomon codes for the rank metric. Important applications of Gabidulin codes include the areas of network coding and distributed storage, particularly for the problem of rank erasure correction. This paper studies the complexity of erasure decoding algorithms for Gabidulin codes with short-to-moderate (not asymptotically long) block lengths. The two fastest known algorithms are compared in detail (in terms of exact number of operations) and it is shown for which parameter values one algorithm is superior to the other.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
