{"id":"https://openalex.org/W2975119248","doi":"https://doi.org/10.1109/isit.2019.8849708","title":"List Decoding Random Euclidean Codes and Infinite Constellations","display_name":"List Decoding Random Euclidean Codes and Infinite Constellations","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975119248","doi":"https://doi.org/10.1109/isit.2019.8849708","mag":"2975119248"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849708","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Yihan Zhang","raw_affiliation_strings":["Dept. of Information Engineering, The Chinese University of Hong Kong, Hong Kong SAR"],"affiliations":[{"raw_affiliation_string":"Dept. of Information Engineering, The Chinese University of Hong Kong, Hong Kong SAR","institution_ids":["https://openalex.org/I177725633"]}]},{"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/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Shashank Vatedka","raw_affiliation_strings":["Dept. of Communications and Electronics, Telecom ParisTech, Paris, France"],"affiliations":[{"raw_affiliation_string":"Dept. of Communications and Electronics, Telecom ParisTech, Paris, France","institution_ids":["https://openalex.org/I12356871"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100350077"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":1.1121,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80570827,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1627","last_page":"1631"},"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.9993000030517578,"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.9993000030517578,"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/T11130","display_name":"Coding theory and cryptography","score":0.9993000030517578,"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/T11797","display_name":"graph theory and CDMA systems","score":0.995199978351593,"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/mathematics","display_name":"Mathematics","score":0.6795239448547363},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6307051181793213},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5409032702445984},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5187404751777649},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5185085535049438},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.49842357635498047},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4874892234802246},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46606165170669556},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4475840926170349},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.41838937997817993},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.2864319682121277},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20965275168418884},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.18910816311836243},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.16470006108283997}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6795239448547363},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6307051181793213},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5409032702445984},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5187404751777649},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5185085535049438},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.49842357635498047},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4874892234802246},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46606165170669556},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4475840926170349},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.41838937997817993},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.2864319682121277},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20965275168418884},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.18910816311836243},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.16470006108283997},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849708","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W591033613","https://openalex.org/W1568318909","https://openalex.org/W1618774954","https://openalex.org/W2122621581","https://openalex.org/W2137971504","https://openalex.org/W2160973043","https://openalex.org/W2163615738","https://openalex.org/W2554594956","https://openalex.org/W2578914304","https://openalex.org/W2887270792","https://openalex.org/W2909394176","https://openalex.org/W2963584190","https://openalex.org/W2964334889","https://openalex.org/W2975119248","https://openalex.org/W4237963784","https://openalex.org/W4299509302","https://openalex.org/W6732420295"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W3083229674","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W3096151594","https://openalex.org/W2964031101","https://openalex.org/W4200209838","https://openalex.org/W2165241191","https://openalex.org/W2798867000"],"abstract_inverted_index":{"We":[0,92,116,135],"study":[1,139],"the":[2,11,15,28,31,40,61,66,69,79,88,108,123,156,174,183,197,206],"list":[3,41,63,82,109,124,198],"decodability":[4],"of":[5,8,17,60,68,78,87,111,142,168,205],"different":[6],"ensembles":[7],"codes":[9,52,98],"over":[10],"real":[12],"alphabet":[13],"under":[14],"assumption":[16],"an":[18,119],"omniscient":[19],"adversary.":[20],"It":[21],"is":[22,44,72,194],"a":[23,58,75,85,94,104,140,190,202],"well-known":[24],"result":[25],"that":[26,145,188],"when":[27],"source":[29],"and":[30,37,65,102,131,138,149,152,165,186],"adversary":[32],"have":[33],"power":[34],"constraints":[35],"P":[36],"N":[38],"respectively,":[39],"decoding":[42],"capacity":[43,54],"equal":[45],"to":[46,73,90,99],"z":[47],"log":[48],"\u00d1.":[49],"Random":[50],"spherical":[51,100,114],"achieve":[53],"with":[55],"constant":[56],"(as":[57],"function":[59,86,204],"blocklength)":[62],"sizes,":[64],"goal":[67],"present":[70],"paper":[71],"obtain":[74],"better":[76],"understanding":[77],"smallest":[80],"achievable":[81,126],"size":[83,110,125,199],"as":[84,162,201],"gap":[89],"capacity.":[91],"show":[93,187],"reduction":[95],"from":[96,182],"arbitrary":[97],"codes,":[101],"derive":[103],"lower":[105,153],"bound":[106,121],"on":[107,122],"typical":[112],"random":[113,179],"codes.":[115],"also":[117],"give":[118],"upper":[120,151],"using":[127],"nested":[128],"Construction-A":[129,133,147],"lattices":[130,148,180],"infinite":[132,143,169],"lattices.":[134],"then":[136,196],"define":[137],"class":[141],"constellations":[144,170],"generalize":[146],"prove":[150],"bounds":[154],"for":[155],"same.":[157],"Other":[158],"goodness":[159,164,167],"properties":[160],"such":[161],"packing":[163],"AWGN":[166],"are":[171],"proved":[172],"along":[173],"way.":[175],"Finally,":[176],"we":[177],"consider":[178],"sampled":[181],"Haar":[184],"distribution":[185],"if":[189],"certain":[191],"number-theoretic":[192],"conjecture":[193],"true,":[195],"grows":[200],"polynomial":[203],"gap-to-capacity.":[207]},"counts_by_year":[{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}