{"id":"https://openalex.org/W4392012033","doi":"https://doi.org/10.1109/tit.2026.3702908","title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","display_name":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","publication_year":2026,"publication_date":"2026-06-11","ids":{"openalex":"https://openalex.org/W4392012033","doi":"https://doi.org/10.1109/tit.2026.3702908"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2026.3702908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3702908","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":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2402.11533","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011716651","display_name":"Jonathan Mosheiff","orcid":"https://orcid.org/0000-0002-7947-1205"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Jonathan Mosheiff","raw_affiliation_strings":["Stein Faculty of Computer and Information Science, Ben Gurion University of the Negev, Be'er Sheva, Israel"],"raw_orcid":"https://orcid.org/0000-0002-7947-1205","affiliations":[{"raw_affiliation_string":"Stein Faculty of Computer and Information Science, Ben Gurion University of the Negev, Be'er Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065218643","display_name":"Nicolas Resch","orcid":"https://orcid.org/0000-0002-5133-5631"},"institutions":[{"id":"https://openalex.org/I55106644","display_name":"Amsterdam University of Applied Sciences","ror":"https://ror.org/00y2z2s03","country_code":"NL","type":"education","lineage":["https://openalex.org/I55106644"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Nicolas Resch","raw_affiliation_strings":["Informatics Institute, University of Amsterdam, Amsterdam, Netherland"],"raw_orcid":"https://orcid.org/0000-0002-5133-5631","affiliations":[{"raw_affiliation_string":"Informatics Institute, University of Amsterdam, Amsterdam, Netherland","institution_ids":["https://openalex.org/I55106644","https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093974036","display_name":"Kuo Shang","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kuo Shang","raw_affiliation_strings":["School of Computer Science, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":"https://orcid.org/0009-0007-3409-7591","affiliations":[{"raw_affiliation_string":"School of Computer Science, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100400874","display_name":"Yuan Chen","orcid":"https://orcid.org/0000-0001-6643-6876"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chen Yuan","raw_affiliation_strings":["School of Computer Science, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0002-3730-8397","affiliations":[{"raw_affiliation_string":"School of Computer Science, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00224838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"72","issue":"8","first_page":"5501","last_page":"5515"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9965000152587891,"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.9965000152587891,"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/T12029","display_name":"DNA and Biological Computing","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9939000010490417,"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/randomness","display_name":"Randomness","score":0.8130420446395874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4347985088825226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3419860601425171},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13464665412902832}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8130420446395874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4347985088825226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3419860601425171},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13464665412902832}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2026.3702908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3702908","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"},{"id":"pmh:oai:arXiv.org:2402.11533","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2402.11533","pdf_url":"https://arxiv.org/pdf/2402.11533","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/f3d7ad97-4fbc-46ee-bb57-776efff218f9","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/randomnessefficient-constructions-of-capacityachieving-listdecodable-codes(f3d7ad97-4fbc-46ee-bb57-776efff218f9).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mosheiff, J, Resch, N, Shang, K & Yuan, C 2026, 'Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes', IEEE Transactions on Information Theory, vol. 72, no. 8, pp. 5501-5515. https://doi.org/10.1109/TIT.2026.3702908","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.2402.11533","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2402.11533","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2402.11533","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2402.11533","pdf_url":"https://arxiv.org/pdf/2402.11533","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4352193945","display_name":null,"funder_award_id":"12361141818","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6723648053","display_name":"Secure and Efficient Code-Based Cryptography","funder_award_id":"VI.Veni.222.347","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7484561724","display_name":null,"funder_award_id":"12426302","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7803837070","display_name":null,"funder_award_id":"12571577","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8247906692","display_name":null,"funder_award_id":"3450/24","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4392012033.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W3034924094","https://openalex.org/W3094954546","https://openalex.org/W1488708774","https://openalex.org/W2981906196","https://openalex.org/W4391100477","https://openalex.org/W4327779705","https://openalex.org/W1513698804","https://openalex.org/W4310560702","https://openalex.org/W2029712093"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,22,88,97,120],"problem":[3],"of":[4,19,84,146,191],"constructing":[5],"(\u03c1,L)-list-decodable":[6],"codesC\u2286":[7],"Fnqwith":[8],"smallqusing":[9],"minimal":[10],"randomness.":[11],"The":[12],"central":[13],"goal":[14],"is":[15],"to":[16,152,156,185],"generate":[17],"codes":[18,102,140],"rate":[20,27],"approaching":[21],"Elias":[23,89,121],"bound,":[24,99],"that":[25,67,141,169],"is,":[26],"at":[28,180],"least":[29],"1":[30],"\u2212h(\u03c1)":[31],"\u2212O(1/L),":[32],"using":[33],"significantly":[34],"fewer":[35],"random":[36,42,51,147,183],"bits":[37,52,111,184],"than":[38],"required":[39],"by":[40,138],"uniformly":[41],"linear":[43,148],"codes.":[44],"Prior":[45],"combinatorial":[46],"constructions":[47,66],"achieve":[48],"this":[49,57,69],"usingO(Ln)":[50],"via":[53],"graph-based":[54],"methods.":[55],"In":[56],"work,":[58],"we":[59,163],"present":[60],"two":[61],"new":[62],"and":[63,76,100,112],"fully":[64],"algebraic":[65],"match":[68],"randomness":[70],"efficiency":[71],"while":[72],"offering":[73],"greater":[74],"simplicity":[75],"structural":[77],"transparency.":[78],"Our":[79,106,135],"first":[80],"construction,":[81],"a":[82,114,160,165],"generalization":[83],"theWozencraft":[85],"ensemble,":[86],"achieves":[87,96,119],"bound":[90,167],"with":[91],"onlyLnrandom":[92],"bits;":[93],"its":[94],"dual":[95,117,124],"Gilbert\u2013Varshamov":[98],"both":[101],"support":[103],"quasilinear-time":[104],"encoding.":[105],"second":[107],"construction":[108,171],"uses":[109],"2nLrandom":[110],"yields":[113],"code":[115],"whose":[116],"also":[118],"bound.":[122],"These":[123],"properties":[125,145],"are":[126],"critical":[127],"for":[128],"applications":[129],"in":[130],"areas":[131],"such":[132,175],"as":[133],"cryptography.":[134],"analysis":[136],"proceeds":[137],"designing":[139],"replicate":[142],"key":[143],"local":[144,176],"codes,":[149],"allowing":[150],"us":[151],"invoke":[153],"known":[154],"results":[155],"deduce":[157],"list-decodability.":[158],"As":[159],"final":[161],"contribution,":[162],"prove":[164],"lower":[166],"showing":[168],"any":[170],"relying":[172],"solely":[173],"on":[174],"approximation":[177],"must":[178],"use":[179],"leastL(1":[181],"\u2212R)nlog2(q)":[182],"obtain":[186],"rate-Rcodes":[187],"over":[188],"an":[189],"alphabet":[190],"sizeq.":[192]},"counts_by_year":[],"updated_date":"2026-08-08T07:41:36.138363","created_date":"2024-02-22T00:00:00"}