{"id":"https://openalex.org/W4415367676","doi":"https://doi.org/10.1109/isit63088.2025.11195274","title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","display_name":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367676","doi":"https://doi.org/10.1109/isit63088.2025.11195274"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/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":true,"raw_author_name":"Jonathan Mosheiff","raw_affiliation_strings":["Ben-Gurion University,Department of Computer Science,Beersheba,Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University,Department of Computer Science,Beersheba,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/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,The Netherlands"],"affiliations":[{"raw_affiliation_string":"Informatics Institute, University of Amsterdam,Amsterdam,The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093974036","display_name":"Kuo Shang","orcid":null},"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":"Kuo Shang","raw_affiliation_strings":["Ben-Gurion University,Department of Computer Science,Beersheba,Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University,Department of Computer Science,Beersheba,Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"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/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":"Chen Yuan","raw_affiliation_strings":["Ben-Gurion University,Department of Computer Science,Beersheba,Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University,Department of Computer Science,Beersheba,Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011716651"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":0.8008,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.77538317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9961000084877014,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9961000084877014,"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/T11130","display_name":"Coding theory and cryptography","score":0.9959999918937683,"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.9934999942779541,"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.7559999823570251},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5410000085830688},{"id":"https://openalex.org/keywords/dual-polyhedron","display_name":"Dual polyhedron","score":0.5378999710083008},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5181000232696533},{"id":"https://openalex.org/keywords/puncturing","display_name":"Puncturing","score":0.48539999127388},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4745999872684479},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.41760000586509705},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.3822999894618988}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7559999823570251},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5410000085830688},{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.5378999710083008},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5231000185012817},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5181000232696533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.490200012922287},{"id":"https://openalex.org/C2778808095","wikidata":"https://www.wikidata.org/wiki/Q3899825","display_name":"Puncturing","level":2,"score":0.48539999127388},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4745999872684479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4429999887943268},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.41760000586509705},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40459999442100525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4002000093460083},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3822999894618988},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3197000026702881},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3154999911785126},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.29190000891685486},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.28360000252723694},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit63088.2025.11195274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/b9f665be-4f5f-4de6-a889-27b03afd2901","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/randomnessefficient-constructions-of-capacityachieving-listdecodable-codes(b9f665be-4f5f-4de6-a889-27b03afd2901).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 2025, Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. in 2025 IEEE International Symposium on Information Theory (ISIT 2025) : Ann Arbor, Michigan, USA, 22-27 June 2025. Piscataway, NJ, pp. 240-245, 2025 IEEE International Symposium on Information Theory, ISIT 2025, Ann Arbor, United States, 22/06/25. https://doi.org/10.1109/ISIT63088.2025.11195274","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/b9f665be-4f5f-4de6-a889-27b03afd2901","is_oa":false,"landing_page_url":"https://hdl.handle.net/11245.1/b9f665be-4f5f-4de6-a889-27b03afd2901","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 2025, Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. in 2025 IEEE International Symposium on Information Theory (ISIT 2025) : Ann Arbor, Michigan, USA, 22-27 June 2025. Piscataway, NJ, pp. 240-245, 2025 IEEE International Symposium on Information Theory, ISIT 2025, Ann Arbor, United States, 22/06/25. https://doi.org/10.1109/ISIT63088.2025.11195274","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W2059108911","https://openalex.org/W2130217481","https://openalex.org/W2146078064","https://openalex.org/W2154198326","https://openalex.org/W2162725776","https://openalex.org/W2625993870","https://openalex.org/W2775887812","https://openalex.org/W2952014918","https://openalex.org/W2982506607","https://openalex.org/W3108728869","https://openalex.org/W3114012130","https://openalex.org/W3129091168","https://openalex.org/W3149161352","https://openalex.org/W3171131516","https://openalex.org/W3214532196","https://openalex.org/W4245256025","https://openalex.org/W4313227449","https://openalex.org/W4399522383","https://openalex.org/W4415367676"],"related_works":[],"abstract_inverted_index":{"In":[0,232],"this":[1],"work,":[2],"we":[3,23,30,71,268,312],"consider":[4],"the":[5,32,67,169,175,191,199,229,235,240,251,272,295,302],"task":[6],"of":[7,57,103,168,234,326,345],"generating":[8],"listdecodable":[9],"codes":[10,27,64,142,252,270,325],"over":[11,331],"small":[12],"(say,":[13],"binary)":[14],"alphabets":[15],"using":[16],"as":[17,20,165,278],"little":[18],"randomness":[19,244],"possible.":[21],"Specifically,":[22],"hope":[24],"to":[25,129,156,255,283,285,322],"generate":[26,323],"achieving":[28,243,271],"what":[29],"term":[31],"Elias":[33,68,176,230,303],"bound,":[34],"which":[35,125,161],"means":[36],"that":[37,60,92,149,294,314],"they":[38],"are":[39,109,126,134,143,152,253],"(<tex":[40],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[41,48,74,95,181,212,247,266,275,329,333,339],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\rho,":[42],"L$</tex>)":[43],"-list-decodable":[44],"with":[45,194,335],"rate":[46,327],"<tex":[47,73,94,180,211,246,265,274,328,332,338],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$R":[49],"\\geq":[50],"1-h(\\rho)-O(1":[51],"/":[52],"L)$</tex>.":[53],"A":[54],"long":[55],"line":[56],"work":[58],"shows":[59],"uniformly":[61],"random":[62,76,98,184,216],"linear":[63],"(RLCs)":[65],"achieve":[66,228],"bound:":[69],"hence,":[70],"know":[72],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O\\left(n^{2}\\right)$</tex>":[75],"bits":[77,99,217,344],"suffice.":[78],"Prior":[79],"works":[80,242],"(Guruswami":[81],"and":[82,87,112,137,178,197,201,218,225,291],"Mosheiff,":[83],"FOCS":[84],"2022;":[85],"Putterman":[86],"Pyne,":[88],"ITCS":[89],"2024)":[90],"demonstrate":[91],"just":[93],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(L":[96,248],"n)$</tex>":[97,249],"suffice,":[100],"via":[101],"puncturing":[102],"low-bias":[104],"codes.":[105],"These":[106],"recent":[107],"constructions":[108,133],"essentially":[110],"combinatorial,":[111],"rely":[113],"(directly":[114],"or":[115],"indirectly)":[116],"on":[117],"graph":[118],"expansion.":[119],"We":[120],"provide":[121],"two":[122],"new":[123],"constructions,":[124],"algebraic.":[127],"Compared":[128],"prior":[130,241],"works,":[131],"our":[132,141],"considerably":[135],"simpler":[136],"more":[138],"direct.":[139],"Furthermore,":[140],"designed":[144,254],"in":[145],"such":[146,315],"a":[147,166,220,261,309,316],"way":[148],"their":[150],"duals":[151],"also":[153,300],"quite":[154],"easy":[155],"analyze.":[157],"Our":[158],"first":[159],"construction":[160,209],"can":[162],"be":[163],"seen":[164],"generalization":[167],"celebrated":[170],"Wozencraft":[171],"ensemble":[172],"-":[173,238,250],"achieves":[174,190,301],"bound":[177,193,304],"consumes":[179,210],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$L":[182],"n$</tex>":[183,215],"bits.":[185],"Additionally,":[186],"its":[187,226],"dual":[188,202,227],"code":[189,221,296],"Gilbert-Varshamov":[192],"high":[195,306],"probability,":[196],"both":[198,223],"primal":[200],"admit":[203],"quasilinear-time":[204],"encoding":[205],"algorithms.":[206],"The":[207],"second":[208],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$2":[213],"L":[214],"yields":[219],"where":[222],"it":[224],"bound.":[231],"all":[233],"above":[236],"cases":[237],"including":[239],"complexity":[245],"\u201capproximate\u201d":[256],"RLCs.":[257,279],"More":[258],"precisely,":[259],"for":[260,289],"given":[262],"locality":[263],"parameter":[264],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$L$</tex>":[267],"construct":[269],"same":[273],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$L$</tex>-local":[276],"properties":[277],"This":[280],"allows":[281],"one":[282],"appeal":[284],"known":[286],"list-decodability":[287],"results":[288],"RLCs":[290],"thereby":[292],"conclude":[293],"approximating":[297],"an":[298],"RLC":[299],"(with":[305],"probability).":[307],"As":[308],"final":[310],"contribution,":[311],"indicate":[313],"proof":[317],"strategy":[318],"is":[319],"inherently":[320],"unable":[321],"list-decodable":[324],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$R$</tex>":[330],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{F}_{q}$</tex>":[334],"less":[336],"than":[337],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$L(1-R)":[340],"n":[341],"\\log":[342],"_{2}(q)$</tex>":[343],"randomness.":[346]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-31T07:56:22.981413","created_date":"2025-10-21T00:00:00"}