{"id":"https://openalex.org/W4399522330","doi":"https://doi.org/10.1145/3618260.3649651","title":"AG Codes Achieve List Decoding Capacity over Constant-Sized Fields","display_name":"AG Codes Achieve List Decoding Capacity over Constant-Sized Fields","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399522330","doi":"https://doi.org/10.1145/3618260.3649651"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649651","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649651","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649651","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649651","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[{"id":"https://openalex.org/I4210121988","display_name":"Film Independent","ror":"https://ror.org/036cy3843","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210121988"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":["Independent Researcher, N/A, USA"],"raw_orcid":"https://orcid.org/0000-0003-4149-7298","affiliations":[{"raw_affiliation_string":"Independent Researcher, N/A, USA","institution_ids":["https://openalex.org/I4210121988"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069822309","display_name":"Manik Dhar","orcid":"https://orcid.org/0009-0000-5570-7116"},"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":"Manik Dhar","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0009-0000-5570-7116","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038687630","display_name":"Sivakanth Gopi","orcid":"https://orcid.org/0000-0001-9706-4171"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sivakanth Gopi","raw_affiliation_strings":["Microsoft Research, Redmond, USA"],"raw_orcid":"https://orcid.org/0000-0001-9706-4171","affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064286096","display_name":"Zihan Zhang","orcid":"https://orcid.org/0000-0001-5393-514X"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zihan Zhang","raw_affiliation_strings":["Ohio State University, Columbus, USA"],"raw_orcid":"https://orcid.org/0000-0001-5393-514X","affiliations":[{"raw_affiliation_string":"Ohio State University, Columbus, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1296,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.88917485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"740","last_page":"751"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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":0.9997000098228455,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9940000176429749,"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/mathematics","display_name":"Mathematics","score":0.666125476360321},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6485774517059326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5569498538970947},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.5419595241546631},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5285338759422302},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.5144105553627014},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.4729297459125519},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.46120303869247437},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4604718089103699},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45579302310943604},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4545114040374756},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.42936721444129944},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4047739505767822},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2986447811126709},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15943199396133423}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.666125476360321},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6485774517059326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5569498538970947},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.5419595241546631},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5285338759422302},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.5144105553627014},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.4729297459125519},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.46120303869247437},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4604718089103699},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45579302310943604},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4545114040374756},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.42936721444129944},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4047739505767822},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2986447811126709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15943199396133423},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3618260.3649651","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649651","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649651","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/155716","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/155716","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/155716/1/3618260.3649651.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Association for Computing Machinery","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649651","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649651","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649651","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.6000000238418579,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399522330.pdf","grobid_xml":"https://content.openalex.org/works/W4399522330.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1599026900","https://openalex.org/W1993830711","https://openalex.org/W1996118782","https://openalex.org/W2010024611","https://openalex.org/W2022841156","https://openalex.org/W2050687505","https://openalex.org/W2052755788","https://openalex.org/W2068593329","https://openalex.org/W2080132708","https://openalex.org/W2133589924","https://openalex.org/W2146078064","https://openalex.org/W2148575324","https://openalex.org/W2405991429","https://openalex.org/W2909303481","https://openalex.org/W2962891889","https://openalex.org/W2963309538","https://openalex.org/W2964144344","https://openalex.org/W2966402083","https://openalex.org/W3035375942","https://openalex.org/W3114012130","https://openalex.org/W3117811306","https://openalex.org/W3184708196","https://openalex.org/W4285191789","https://openalex.org/W4288391452","https://openalex.org/W4289655195","https://openalex.org/W4306681222","https://openalex.org/W4376651386","https://openalex.org/W4386075197","https://openalex.org/W4390097886","https://openalex.org/W4399039536","https://openalex.org/W4399522330","https://openalex.org/W4399522376","https://openalex.org/W4399522383"],"related_works":["https://openalex.org/W3088883112","https://openalex.org/W2293846540","https://openalex.org/W2247418595","https://openalex.org/W3021758908","https://openalex.org/W1798117689","https://openalex.org/W2963132315","https://openalex.org/W4298280412","https://openalex.org/W1976052006","https://openalex.org/W2625239423","https://openalex.org/W4250675451"],"abstract_inverted_index":{"The":[0,128],"recently-emerging":[1],"field":[2,242,288],"of":[3,14,57,89,105,161,213,228],"higher":[4,23,107],"order":[5,24,108],"MDS":[6,25,109],"codes":[7,26,33,39,61,81,137,148,195,212,250,270,285],"has":[8],"sought":[9],"to":[10,133,144,165,219,246,255],"unify":[11],"a":[12,87,102,150,272],"number":[13],"concepts":[15],"in":[16,45],"coding":[17],"theory.":[18],"Such":[19],"areas":[20],"captured":[21],"by":[22,71,100,178,198],"include":[27],"maximally":[28],"recoverable":[29],"(MR)":[30],"tensor":[31,147,269,284],"codes,":[32,263],"with":[34,40,149,222,237,271],"optimal":[35,90,135],"list-decoding":[36,83,235,257],"guarantees,":[37],"and":[38,73,125,138,163,241],"constrained":[41],"generator":[42],"matrices":[43],"(as":[44],"the":[46,55,139,159,189,202],"GM-MDS":[47,191],"theorem).":[48],"By":[49,259],"proving":[50],"these":[51,98,169],"equivalences,":[52],"Brakensiek-Gopi-Makam":[53],"showed":[54],"existence":[56],"optimally":[58],"list-decodable":[59,136,217],"Reed-Solomon":[60,80],"over":[62,92,174,226,278],"exponential":[63,287],"sized":[64],"fields.":[65,95],"Building":[66],"on":[67],"this,":[68,185],"recent":[69],"breakthroughs":[70],"Guo-Zhang":[72,162],"Alrabiah-Guruswami-Li":[74,164],"have":[75],"shown":[76],"that":[77,115,167],"randomly":[78,179,260],"punctured":[79,210],"achieve":[82,234,256],"capacity":[84,236],"(which":[85],"is":[86,131,142],"relaxation":[88,130,141],"list-decodability)":[91],"linear":[93],"size":[94,176,224,229,239,243],"We":[96,156,200],"extend":[97],"works":[99],"developing":[101],"formal":[103],"theory":[104],"relaxed":[106,134,145,267],"codes.":[110,183],"In":[111,231],"particular,":[112,232],"we":[113,122,186,264],"show":[114,166],"there":[116],"are":[117,216],"two":[118],"inequivalent":[119],"relaxations":[120,170],"which":[121],"call":[123],"lower":[124,129],"upper":[126,140],"relaxations.":[127],"equivalent":[132,143],"MR":[146,268,283],"single":[151,273],"parity":[152,274],"check":[153,275],"per":[154,276],"column.":[155],"then":[157],"generalize":[158],"techniques":[160],"both":[168],"can":[171,265],"be":[172],"constructed":[173],"constant":[175],"fields":[177,227],"puncturing":[180,261],"suitable":[181],"algebraic-geometric":[182,211,262],"For":[184],"crucially":[187],"use":[188],"generalized":[190],"theorem":[192],"for":[193],"polynomial":[194],"recently":[196],"proved":[197],"Brakensiek-Dhar-Gopi.":[199],"obtain":[201],"following":[203],"corollaries":[204],"from":[205],"our":[206],"main":[207],"result:":[208],"Randomly":[209],"rate":[214],"R":[215],"up":[218],"radius":[220],"L/L+1(1\u2212R\u2212\u0454)":[221],"list":[223,238],"L":[225],"exp(O(L/\u0454)).":[230],"they":[233],"O(1/\u0454)":[240],"exp(O(1/\u04542)).":[244],"Prior":[245],"this":[247],"work,":[248],"AG":[249],"were":[251],"not":[252],"even":[253],"known":[254],"capacity.":[258],"construct":[266],"column":[277],"constant-sized":[279],"fields,":[280],"whereas":[281],"(non-relaxed)":[282],"require":[286],"size.":[289]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}