{"title":"A maximum likelihood polynomial time syndrome decoder to correct linearly independent errors","authors":"G. Horn, R. Karp","doi":"10.1109/ISIT.2001.935950","DOIUrl":null,"url":null,"abstract":"It is shown for a linear code over F/sub 2/L, defined by a binary parity matrix H, that the minimum weight error vector e associated with a syndrome s can be computed in polynomial time if the nonzero elements of the error vector are linearly independent over F/sub 2/L.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"446 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
It is shown for a linear code over F/sub 2/L, defined by a binary parity matrix H, that the minimum weight error vector e associated with a syndrome s can be computed in polynomial time if the nonzero elements of the error vector are linearly independent over F/sub 2/L.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
