{"id":"https://openalex.org/W4289655414","doi":"https://doi.org/10.1109/isit50566.2022.9834815","title":"Lower Bounds on List Decoding Capacity using Error Exponents","display_name":"Lower Bounds on List Decoding Capacity using Error Exponents","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655414","doi":"https://doi.org/10.1109/isit50566.2022.9834815"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834815","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834815","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5100350077","display_name":"Yihan Zhang","orcid":"https://orcid.org/0000-0002-6465-6258"},"institutions":[{"id":"https://openalex.org/I132118926","display_name":"Austrian Institute of Technology","ror":"https://ror.org/04knbh022","country_code":"AT","type":"facility","lineage":["https://openalex.org/I132118926"]},{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Yihan Zhang","raw_affiliation_strings":["Institute of Science and Technology,Austria","Institute of Science and Technology, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Science and Technology,Austria","institution_ids":["https://openalex.org/I132118926"]},{"raw_affiliation_string":"Institute of Science and Technology, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028319993","display_name":"Shashank Vatedka","orcid":"https://orcid.org/0000-0003-2384-9392"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shashank Vatedka","raw_affiliation_strings":["Indian Institute of Technology,Department of Electrical Engineering,Hyderabad","Department of Electrical Engineering, Indian Institute of Technology, Hyderabad"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology,Department of Electrical Engineering,Hyderabad","institution_ids":["https://openalex.org/I65181880"]},{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, Hyderabad","institution_ids":["https://openalex.org/I65181880"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100350077"],"corresponding_institution_ids":["https://openalex.org/I132118926","https://openalex.org/I157556583"],"apc_list":null,"apc_paid":null,"fwci":0.2148,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.2974132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1324","last_page":"1329"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8166251182556152},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.7247115969657898},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7141515016555786},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6538691520690918},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6124305725097656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5521779656410217},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5402076244354248},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5338149666786194},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5201085805892944},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.467040479183197},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.4635671079158783},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.4580163061618805},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.439716100692749},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4264417290687561},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42492902278900146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3006311058998108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2305702269077301},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14993605017662048},{"id":"https://openalex.org/keywords/white-noise","display_name":"White noise","score":0.12964636087417603},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.10996749997138977},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07953742146492004}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8166251182556152},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.7247115969657898},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7141515016555786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6538691520690918},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6124305725097656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5521779656410217},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5402076244354248},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5338149666786194},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5201085805892944},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.467040479183197},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.4635671079158783},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.4580163061618805},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.439716100692749},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4264417290687561},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42492902278900146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3006311058998108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2305702269077301},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14993605017662048},{"id":"https://openalex.org/C112633086","wikidata":"https://www.wikidata.org/wiki/Q381287","display_name":"White noise","level":2,"score":0.12964636087417603},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.10996749997138977},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07953742146492004},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit50566.2022.9834815","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834815","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:raiith.iith.ac.in:10387","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400292","display_name":"Research Archive of Indian Institute of Technology Hyderabad (Indian Institute of Technology Hyderabad)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I65181880","host_organization_name":"Indian Institute of Technology Hyderabad","host_organization_lineage":["https://openalex.org/I65181880"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:pub.research-explorer.ista.ac.at:12018","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9834815","pdf_url":null,"source":{"id":"https://openalex.org/S7407055285","display_name":"Institute of Science and Technology Austria","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zhang Y, Vatedka S. Lower bounds on list decoding capacity using error exponents. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:1324-1329. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">10.1109/ISIT50566.2022.9834815</a>","raw_type":"http://purl.org/coar/resource_type/c_5794"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W144396020","https://openalex.org/W1568318909","https://openalex.org/W1989008275","https://openalex.org/W1992861967","https://openalex.org/W2020079668","https://openalex.org/W2039760073","https://openalex.org/W2040949867","https://openalex.org/W2044180609","https://openalex.org/W2098320263","https://openalex.org/W2106215079","https://openalex.org/W2122459744","https://openalex.org/W2124291447","https://openalex.org/W2163615738","https://openalex.org/W2170716519","https://openalex.org/W2964334889","https://openalex.org/W2975119248","https://openalex.org/W2977073685","https://openalex.org/W3080751879","https://openalex.org/W3178780836","https://openalex.org/W4292414116","https://openalex.org/W4294579794","https://openalex.org/W6602216524","https://openalex.org/W6604469142","https://openalex.org/W6605775354","https://openalex.org/W6676144961","https://openalex.org/W6797846821"],"related_works":["https://openalex.org/W2885207344","https://openalex.org/W2090152127","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W2008939113","https://openalex.org/W14679004","https://openalex.org/W1566651525","https://openalex.org/W2977652649","https://openalex.org/W2318206461","https://openalex.org/W37157938"],"abstract_inverted_index":{"We":[0,75,121,145],"study":[1,76],"the":[2,6,92,97,128,137,150],"problem":[3,78],"of":[4,9,55,73,133,142,165],"characterizing":[5],"maximal":[7,98],"rates":[8],"list":[10,17,112,154],"decoding":[11,113,155],"in":[12,60,156],"Euclidean":[13,53],"spaces":[14],"for":[15,100,111,153],"finite":[16],"sizes.":[18],"For":[19],"any":[20],"positive":[21],"integer":[22],"L":[23,69],"\u2265":[24],"2":[25],"and":[26,80,90,159],"real":[27],"N":[28],">":[29],"0,":[30],"we":[31],"say":[32],"that":[33],"a":[34,123,131,140],"subset":[35],"$\\mathcal{C}":[36],"\\subset":[37],"{\\mathbb{R}^n}$":[38],"is":[39],"an":[40,46],"(N,L":[41],"\u2013":[42],"1)-multiple":[43],"packing":[44],"or":[45],"(N,L\u2013":[47],"1)-list":[48],"decodable":[49],"code":[50],"if":[51],"every":[52],"ball":[54],"radius":[56],"$\\sqrt":[57],"{nN}":[58],"$":[59],"\u211d":[61],"<sup":[62],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[63,84],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[64],"contains":[65],"no":[66],"more":[67],"than":[68],"\u2212":[70],"1":[71],"points":[72],"C.":[74],"this":[77],"with":[79],"without":[81],"\u2113":[82],"<inf":[83],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[85],"norm":[86],"constraints":[87],"on":[88,96,149],"$\\mathcal{C}$,":[89],"derive":[91,146],"best-known":[93],"lower":[94],"bounds":[95,105,148],"rate":[99],"(N,L\u22121)":[101],"multiple":[102,169],"packing.":[103,170],"Our":[104],"are":[106],"obtained":[107],"via":[108],"error":[109,129,151],"exponents":[110],"over":[114],"Additive":[115],"White":[116],"Gaussian":[117],"Noise":[118],"(AWGN)":[119],"channels.":[120],"establish":[122],"curious":[124],"inequality":[125],"which":[126,162],"relates":[127],"exponent,":[130],"quantity":[132,141],"average-case":[134],"nature,":[135],"to":[136],"list-decoding":[138],"radius,":[139],"worst-case":[143],"nature.":[144],"various":[147],"exponent":[152],"both":[157],"bounded":[158],"unbounded":[160],"settings":[161],"could":[163],"be":[164],"independent":[166],"interest":[167],"beyond":[168]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}