{"id":"https://openalex.org/W2275285919","doi":"https://doi.org/10.1109/isit.2015.7282852","title":"Upper bound on list-decoding radius of binary codes","display_name":"Upper bound on list-decoding radius of binary codes","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W2275285919","doi":"https://doi.org/10.1109/isit.2015.7282852","mag":"2275285919"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282852","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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/A5031031216","display_name":"Yury Polyanskiy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yury Polyanskiy","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031031216"],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":0.3946,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68445824,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":null,"first_page":"2231","last_page":"2235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9997000098228455,"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/T11130","display_name":"Coding theory and cryptography","score":0.9988999962806702,"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/hamming-space","display_name":"Hamming space","score":0.769604504108429},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6903817653656006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6667258739471436},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6666197180747986},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6410487294197083},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.625171959400177},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6001505851745605},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4907127618789673},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4880574941635132},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.486642450094223},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.486419677734375},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.4768851101398468},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39247918128967285},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.346357524394989},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3095332384109497},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.26336583495140076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15834751725196838},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09495210647583008},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08506891131401062}],"concepts":[{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.769604504108429},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6903817653656006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6667258739471436},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6666197180747986},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6410487294197083},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.625171959400177},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6001505851745605},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4907127618789673},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4880574941635132},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.486642450094223},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.486419677734375},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.4768851101398468},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39247918128967285},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.346357524394989},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3095332384109497},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.26336583495140076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15834751725196838},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09495210647583008},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08506891131401062},{"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/isit.2015.7282852","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"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/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/W2275285919","https://openalex.org/W2568815128","https://openalex.org/W4299554469","https://openalex.org/W6676144961","https://openalex.org/W6684716356","https://openalex.org/W6694146015"],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W2613408642","https://openalex.org/W2182731056","https://openalex.org/W4235868261","https://openalex.org/W1519122282","https://openalex.org/W4380994333","https://openalex.org/W2158117886","https://openalex.org/W2140899540","https://openalex.org/W2998312549","https://openalex.org/W2178048337"],"abstract_inverted_index":{"Consider":[0],"the":[1,14,22,41,53,73,88,113,116],"problem":[2],"of":[3,7,21,43,72,77,90,100,115],"packing":[4,46],"Hamming":[5,24],"balls":[6],"a":[8,64,70,97],"given":[9],"relative":[10],"radius":[11],"subject":[12],"to":[13,58,86],"constraint":[15],"that":[16,108],"they":[17],"cover":[18],"any":[19,44],"point":[20],"ambient":[23],"space":[25],"with":[26],"multiplicity":[27],"at":[28,121],"most":[29],"L.":[30],"For":[31],"odd":[32,111],"L":[33,93,112],"\u2265":[34],"3":[35],"an":[36,103],"asymptotic":[37],"upper":[38],"bound":[39,51,56],"on":[40],"rate":[42],"such":[45],"is":[47,69,106,119],"proven.":[48],"The":[49,67],"resulting":[50],"improves":[52],"best":[54],"known":[55],"(due":[57],"Blinovsky'":[59],"1986)":[60],"for":[61,92,109],"rates":[62],"below":[63],"certain":[65],"threshold.":[66],"method":[68],"superposition":[71],"linear-":[74],"programming":[75],"idea":[76],"Ashikhmin,":[78],"Barg":[79],"and":[80,96],"Litsyn":[81],"(that":[82],"was":[83],"used":[84],"previously":[85],"improve":[87],"estimates":[89],"Blinovsky":[91],"=":[94],"2)":[95],"Ramsey-theoretic":[98],"technique":[99],"Blinovsky.":[101],"As":[102],"application":[104],"it":[105],"shown":[107],"all":[110],"slope":[114],"rate-radius":[117],"tradeoff":[118],"zero":[120,122],"rate.":[123]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}