{"id":"https://openalex.org/W1797635110","doi":"https://doi.org/10.1109/tit.2016.2538766","title":"List-Decoding Algorithms for Lifted Codes","display_name":"List-Decoding Algorithms for Lifted Codes","publication_year":2016,"publication_date":"2016-03-07","ids":{"openalex":"https://openalex.org/W1797635110","doi":"https://doi.org/10.1109/tit.2016.2538766","mag":"1797635110"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2016.2538766","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2016.2538766","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069208863","display_name":"Alan Guo","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Guo","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031695135","display_name":"Swastik Kopparty","orcid":"https://orcid.org/0000-0003-2704-8808"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Swastik Kopparty","raw_affiliation_strings":["Department of Mathematics and the Department of Computer Science, Rutgers University, New Brunswick, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and the Department of Computer Science, Rutgers University, New Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1655,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.90147356,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"62","issue":"5","first_page":"2719","last_page":"2725"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7706006765365601},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.6442395448684692},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.637970507144928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.590201735496521},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5867818593978882},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5603275895118713},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.510286808013916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46831613779067993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4198509752750397},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3916306495666504},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.38764142990112305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3853392004966736},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.37985387444496155}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7706006765365601},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.6442395448684692},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.637970507144928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.590201735496521},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5867818593978882},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5603275895118713},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.510286808013916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46831613779067993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4198509752750397},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3916306495666504},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.38764142990112305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3853392004966736},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.37985387444496155}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2016.2538766","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2016.2538766","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2203872170","display_name":null,"funder_award_id":"CCF-0829672","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G4676997490","display_name":null,"funder_award_id":"CCF-1253886","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G7618564757","display_name":null,"funder_award_id":"CCF-6922462","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G8048865432","display_name":null,"funder_award_id":"CCF-1065125","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W166857703","https://openalex.org/W241194042","https://openalex.org/W1617915743","https://openalex.org/W1901622511","https://openalex.org/W1976016860","https://openalex.org/W2021999231","https://openalex.org/W2032431003","https://openalex.org/W2048651540","https://openalex.org/W2074064997","https://openalex.org/W2083259457","https://openalex.org/W2109831361","https://openalex.org/W2117571667","https://openalex.org/W2171684223","https://openalex.org/W2293846540","https://openalex.org/W2406581081","https://openalex.org/W2610313478","https://openalex.org/W2611959999","https://openalex.org/W2952264757","https://openalex.org/W6606693556","https://openalex.org/W6628919979"],"related_works":["https://openalex.org/W2050784748","https://openalex.org/W2359973017","https://openalex.org/W1980817751","https://openalex.org/W1548705449","https://openalex.org/W2247418595","https://openalex.org/W2121498709","https://openalex.org/W4245516769","https://openalex.org/W4253103868","https://openalex.org/W2133789648","https://openalex.org/W2255105136"],"abstract_inverted_index":{"Lifted":[0],"Reed-Solomon":[1],"codes":[2,68],"are":[3,54,69],"a":[4,57,79,96],"natural":[5],"affine-invariant":[6],"family":[7],"of":[8,49,66],"error-correcting":[9],"codes,":[10],"which":[11,61],"generalize":[12],"Reed-Muller":[13,31],"codes.":[14,51],"They":[15],"were":[16],"known":[17,28],"to":[18],"have":[19],"efficient":[20,40],"local-testing":[21],"and":[22,45],"local-decoding":[23],"algorithms":[24,29,41,53],"(comparable":[25],"with":[26,34],"the":[27,64],"for":[30,42],"codes),":[32],"but":[33],"significantly":[35],"better":[36],"rate.":[37],"We":[38],"give":[39],"list":[43,47],"decoding":[44,48],"local":[46],"lifted":[50,67],"Our":[52],"based":[55],"on":[56],"new":[58],"technical":[59],"lemma,":[60],"says":[62],"that":[63],"codewords":[65],"low":[70],"degree":[71,89],"polynomials":[72,77,94],"when":[73,90],"viewed":[74,91],"as":[75,92],"univariate":[76],"over":[78,95],"big":[80],"field":[81],"(even":[82],"though":[83],"they":[84],"may":[85],"be":[86],"very":[87],"high":[88],"multivariate":[93],"small":[97],"field).":[98]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}