{"title":"有限网格上Reed-Muller码的译码变体","authors":"SrinivasanSrikanth, TripathiUtkarsh, VenkiteshS.","doi":"10.1145/3417754","DOIUrl":null,"url":null,"abstract":"In a recent article, Kim and Kopparty (2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid S1 Sm. We show that their alg...","PeriodicalId":44045,"journal":{"name":"ACM Transactions on Computation Theory","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2020-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3417754","citationCount":"1","resultStr":"{\"title\":\"Decoding Variants of Reed-Muller Codes over Finite Grids\",\"authors\":\"SrinivasanSrikanth, TripathiUtkarsh, VenkiteshS.\",\"doi\":\"10.1145/3417754\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a recent article, Kim and Kopparty (2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid S1 Sm. We show that their alg...\",\"PeriodicalId\":44045,\"journal\":{\"name\":\"ACM Transactions on Computation Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2020-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1145/3417754\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Computation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3417754\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3417754","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Decoding Variants of Reed-Muller Codes over Finite Grids
In a recent article, Kim and Kopparty (2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid S1 Sm. We show that their alg...
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
