发布求助
文献互助 智能选刊 最新文献

有限网格上Reed-Muller码的译码变体

IF 0.8 Q3 COMPUTER SCIENCE, THEORY & METHODS
ACM Transactions on Computation Theory Pub Date : 2020-11-08 DOI:10.1145/3417754
SrinivasanSrikanth, TripathiUtkarsh, VenkiteshS.
{"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":"12 1","pages":"1-11"},"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\":\"12 1\",\"pages\":\"1-11\"},\"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}
引用次数: 1

摘要

在最近的一篇文章中，Kim和Kopparty(2017)给出了一种确定性算法，用于一般网格S1 Sm上有界总度多项式的唯一解码问题。我们展示了他们的…
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
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...
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on Computation Theory
ACM Transactions on Computation Theory COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
2.30
自引率
0.00%
发文量
10
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信