{"id":"https://openalex.org/W2568815128","doi":"https://doi.org/10.1109/tit.2016.2516560","title":"Upper Bound on List-Decoding Radius of Binary Codes","display_name":"Upper Bound on List-Decoding Radius of Binary Codes","publication_year":2016,"publication_date":"2016-01-11","ids":{"openalex":"https://openalex.org/W2568815128","doi":"https://doi.org/10.1109/tit.2016.2516560","mag":"2568815128"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2016.2516560","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2016.2516560","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":["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/A5031031216","display_name":"Yury Polyanskiy","orcid":null},"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":true,"raw_author_name":"Yury Polyanskiy","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031031216"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.3939,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.84447182,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"62","issue":"3","first_page":"1119","last_page":"1128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9987000226974487,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7512010335922241},{"id":"https://openalex.org/keywords/hamming-space","display_name":"Hamming space","score":0.74952232837677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6930977702140808},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6797023415565491},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6258970499038696},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5944271087646484},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5877443552017212},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5381693840026855},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.5088727474212646},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.47485899925231934},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.4742143154144287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.434505820274353},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4274170398712158},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.30663105845451355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27541494369506836},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.23324263095855713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10194078087806702},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09649121761322021},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.0772581398487091}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7512010335922241},{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.74952232837677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6930977702140808},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6797023415565491},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6258970499038696},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5944271087646484},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5877443552017212},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5381693840026855},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.5088727474212646},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.47485899925231934},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.4742143154144287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.434505820274353},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4274170398712158},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.30663105845451355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27541494369506836},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.23324263095855713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10194078087806702},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09649121761322021},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0772581398487091},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2016.2516560","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2016.2516560","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4830235557","display_name":null,"funder_award_id":"CCF-13-18620","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1510599311","https://openalex.org/W1583202823","https://openalex.org/W1659060437","https://openalex.org/W1981075218","https://openalex.org/W2036600344","https://openalex.org/W2045503106","https://openalex.org/W2052181759","https://openalex.org/W2088668281","https://openalex.org/W2096684552","https://openalex.org/W2106215079","https://openalex.org/W2109084006","https://openalex.org/W2162706887","https://openalex.org/W2167345614","https://openalex.org/W4299554469","https://openalex.org/W6676144961","https://openalex.org/W6684716356"],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W2613408642","https://openalex.org/W2182731056","https://openalex.org/W4235868261","https://openalex.org/W1503555387","https://openalex.org/W1519122282","https://openalex.org/W4380994333","https://openalex.org/W2158117886","https://openalex.org/W2140899540","https://openalex.org/W2998312549"],"abstract_inverted_index":{"Consider":[0],"the":[1,14,22,41,53,72,86,111,114],"problem":[2],"of":[3,7,21,43,71,75,88,98,113],"packing":[4,46],"Hamming":[5,24],"balls":[6],"a":[8,63,69,95],"given":[9],"relative":[10],"radius":[11,116],"subject":[12],"to":[13,58,84],"constraint":[15],"that":[16,106],"they":[17],"cover":[18],"any":[19,44],"point":[20],"ambient":[23],"space":[25],"with":[26],"multiplicity":[27],"at":[28,120],"most":[29],"L.":[30],"For":[31],"odd":[32,109],"L":[33,91],"\u2265":[34],"3,":[35],"an":[36,101],"asymptotic":[37],"upper":[38],"bound":[39,51,56],"on":[40],"rate":[42,115],"such":[45],"is":[47,68,104,118],"proved.":[48],"The":[49,66],"resulting":[50],"improves":[52],"best":[54],"known":[55],"(due":[57],"Blinovsky'1986)":[59],"for":[60,90,107],"rates":[61],"below":[62],"certain":[64],"threshold.":[65],"method":[67],"superposition":[70],"linear-programming":[73],"idea":[74],"Ashikhmin,":[76],"Barg,":[77],"and":[78,94],"Litsyn":[79],"(that":[80],"was":[81],"previously":[82],"used":[83],"improve":[85],"estimates":[87],"Blinovsky":[89],"=":[92],"2)":[93],"Ramsey-theoretic":[96],"technique":[97],"Blinovsky.":[99],"As":[100],"application,":[102],"it":[103],"shown":[105],"all":[108],"L,":[110],"slope":[112],"tradeoff":[117],"zero":[119,121],"rate.":[122]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}