{"id":"https://openalex.org/W1980420346","doi":"https://doi.org/10.1109/isit.2013.6620457","title":"On Chebyshev radius of a set in Hamming space and the closest string problem","display_name":"On Chebyshev radius of a set in Hamming space and the closest string problem","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1980420346","doi":"https://doi.org/10.1109/isit.2013.6620457","mag":"1980420346"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/90564","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051046818","display_name":"Arya Mazumdar","orcid":"https://orcid.org/0000-0003-4605-7996"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arya Mazumdar","raw_affiliation_strings":["Department of ECE, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","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":false,"raw_author_name":"Yury Polyanskiy","raw_affiliation_strings":["Department of EECS, Massachusetts Institute of Technology, Cambridge, MA, USA","Dept. of EECS, Massachusetts Inst. of Technol., Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of EECS, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Dept. of EECS, Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110611660","display_name":"Barna Saha","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Barna Saha","raw_affiliation_strings":["Shannon Laboratories, AT&T Laboratories Research, Florham Park, NJ, USA","[AT&T Shannon Labs., Florham Park, NJ, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shannon Laboratories, AT&T Laboratories Research, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"[AT&T Shannon Labs., Florham Park, NJ, USA]","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9152,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.73564084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1401","last_page":"1405"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996999979019165,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6718587875366211},{"id":"https://openalex.org/keywords/chebyshev-filter","display_name":"Chebyshev filter","score":0.6245211958885193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6012570261955261},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5774450898170471},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.5380821228027344},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.5053554177284241},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.47715991735458374},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.47281089425086975},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.46515899896621704},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4620389938354492},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46015575528144836},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45895132422447205},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45218250155448914},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3383668065071106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2003518044948578},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13259682059288025}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6718587875366211},{"id":"https://openalex.org/C21424316","wikidata":"https://www.wikidata.org/wiki/Q718621","display_name":"Chebyshev filter","level":2,"score":0.6245211958885193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6012570261955261},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5774450898170471},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.5380821228027344},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.5053554177284241},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.47715991735458374},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.47281089425086975},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.46515899896621704},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4620389938354492},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46015575528144836},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45895132422447205},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45218250155448914},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3383668065071106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2003518044948578},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13259682059288025},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2013.6620457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.395.6713","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.umn.edu/users/arya/papers/radius_isit.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/90564","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/90564","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/90564","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/90564","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1739869781","display_name":null,"funder_award_id":"CCF-0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6244900323","display_name":"Emerging Frontiers of Science of Information","funder_award_id":"0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309636","display_name":"University of Minnesota","ror":"https://ror.org/03grvy078"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W13422762","https://openalex.org/W1558042394","https://openalex.org/W1563332361","https://openalex.org/W1606480398","https://openalex.org/W1646289414","https://openalex.org/W1757162420","https://openalex.org/W1934919341","https://openalex.org/W1983410903","https://openalex.org/W1998732904","https://openalex.org/W2006830086","https://openalex.org/W2022191808","https://openalex.org/W2029494882","https://openalex.org/W2047386086","https://openalex.org/W2052181759","https://openalex.org/W2059651397","https://openalex.org/W2065465262","https://openalex.org/W2077595184","https://openalex.org/W2103012681","https://openalex.org/W2107423006","https://openalex.org/W2133355890","https://openalex.org/W2139594840","https://openalex.org/W2142293082","https://openalex.org/W2321606360","https://openalex.org/W2611804663","https://openalex.org/W4233413206","https://openalex.org/W4236055811","https://openalex.org/W4249318479","https://openalex.org/W4253418273","https://openalex.org/W6636396655","https://openalex.org/W6646451807"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W2963549154","https://openalex.org/W2158117886","https://openalex.org/W1987803429","https://openalex.org/W1582340598","https://openalex.org/W1519122282","https://openalex.org/W2182731056","https://openalex.org/W3013281356","https://openalex.org/W2740543340"],"abstract_inverted_index":{"The":[0],"Chebyshev":[1],"radius":[2,15,31],"of":[3,16,32,53,55,86],"a":[4,7,62,77],"set":[5,34],"in":[6,36,44,57,76],"metric":[8],"space":[9],"is":[10,25,41],"defined":[11],"to":[12,28],"be":[13],"the":[14,17,21,29,33,71,84,87],"smallest":[18],"ball":[19],"containing":[20],"set.":[22],"This":[23,47,74],"quantity":[24],"closely":[26],"related":[27],"covering":[30],"and,":[35],"particular":[37],"for":[38],"Hamming":[39,59],"set,":[40],"extensively":[42],"studied":[43],"computational":[45],"biology.":[46],"paper":[48],"investigates":[49],"some":[50],"basic":[51],"properties":[52],"radii":[54],"sets":[56],"n-dimensional":[58],"space,":[60],"provides":[61],"linear":[63],"programing":[64],"relaxation":[65],"and":[66],"gives":[67],"tight":[68],"bounds":[69],"on":[70],"integrality":[72],"gap.":[73],"results":[75],"simple":[78],"polynomial-time":[79],"approximation":[80],"algorithm":[81],"that":[82],"attains":[83],"performance":[85],"best":[88],"known":[89],"such":[90],"algorithms":[91],"with":[92],"shorter":[93],"running":[94],"time.":[95]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}