{"title":"On fast decoding of interleaved Gabidulin codes","authors":"V. Sidorenko, A. Wachter-Zeh, Di Chen","doi":"10.1109/RED.2012.6338413","DOIUrl":null,"url":null,"abstract":"Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over Fqm a fast decoding algorithm is proposed correcting with high probability errors of rank up to L over L+1(d-1). The algorithm is based on fast skew-feedback shift-register synthesis and for fixed L has time complexity O(m3logm) operations in the base field Fq.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"429 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2012.6338413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over Fqm a fast decoding algorithm is proposed correcting with high probability errors of rank up to L over L+1(d-1). The algorithm is based on fast skew-feedback shift-register synthesis and for fixed L has time complexity O(m3logm) operations in the base field Fq.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
