{"id":"https://openalex.org/W1623581787","doi":"https://doi.org/10.1109/isit.2015.7282532","title":"Optimal binary switch codes with small query size","display_name":"Optimal binary switch codes with small query size","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1623581787","doi":"https://doi.org/10.1109/isit.2015.7282532","mag":"1623581787"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282532","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282532","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/A5047295889","display_name":"Zhiying Wang","orcid":"https://orcid.org/0000-0003-3339-3085"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhiying Wang","raw_affiliation_strings":["Center for Science of Information, Stanford University, Stanford, CA, USA","Center for Science of Information, Stanford University, CA 94305, USA"],"affiliations":[{"raw_affiliation_string":"Center for Science of Information, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Center for Science of Information, Stanford University, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083157397","display_name":"Han Mao Kiah","orcid":"https://orcid.org/0000-0001-5611-0848"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Han Mao Kiah","raw_affiliation_strings":["School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore","School of Physical & Mathematical Sciences, Nanyang Technological University, 21 Nanyang Link, 637371, Singapore"],"affiliations":[{"raw_affiliation_string":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Physical & Mathematical Sciences, Nanyang Technological University, 21 Nanyang Link, 637371, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063057008","display_name":"Yuval Cassuto","orcid":"https://orcid.org/0000-0001-6369-6699"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yuval Cassuto","raw_affiliation_strings":["Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","Department of Electrical Engineering, Technion\u2014Israel Institute of Technology, Haifa 3200003, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Department of Electrical Engineering, Technion\u2014Israel Institute of Technology, Haifa 3200003, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047295889"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":4.9923,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.95455848,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"16","issue":null,"first_page":"636","last_page":"640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","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/T11181","display_name":"Advanced Data Storage Technologies","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/T12029","display_name":"DNA and Biological Computing","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9973000288009644,"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/code-word","display_name":"Code word","score":0.7775452136993408},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6806386113166809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6577314138412476},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6532050967216492},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5670979022979736},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5402107238769531},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5296340584754944},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5059494376182556},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48765742778778076},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4609769582748413},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4525638222694397},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.45088067650794983},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.42892006039619446},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37654411792755127},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3049295246601105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29047489166259766},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2865217924118042},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2686128616333008},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19910326600074768}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7775452136993408},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6806386113166809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6577314138412476},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6532050967216492},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5670979022979736},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5402107238769531},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5296340584754944},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5059494376182556},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48765742778778076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4609769582748413},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4525638222694397},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.45088067650794983},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.42892006039619446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37654411792755127},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3049295246601105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29047489166259766},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2865217924118042},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2686128616333008},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19910326600074768},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282532","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282532","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":10,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W2001766583","https://openalex.org/W2039896106","https://openalex.org/W2050413942","https://openalex.org/W2080339104","https://openalex.org/W2088336724","https://openalex.org/W2550412208","https://openalex.org/W2963063105","https://openalex.org/W2963120590","https://openalex.org/W4292717601"],"related_works":["https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2113911300","https://openalex.org/W2151857680","https://openalex.org/W4386066307","https://openalex.org/W832867880","https://openalex.org/W917159298","https://openalex.org/W1975697476","https://openalex.org/W2118665614"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"a":[5,15,19,80],"construction":[6,36,83],"of":[7,22,32,64,88],"binary":[8],"switch":[9,12,89],"codes.":[10],"A":[11],"code":[13,16,59],"is":[14,37,55,75,84],"such":[17],"that":[18,42],"multi-set":[20],"request":[21,74],"information":[23,70],"symbols":[24],"can":[25],"be":[26],"simultaneously":[27],"recovered":[28],"from":[29],"disjoint":[30],"sets":[31],"codeword":[33,47],"symbols.":[34],"Our":[35],"optimal":[38],"in":[39,57,72],"the":[40,45,58,62,73,85],"sense":[41],"it":[43],"has":[44],"smallest":[46],"length":[48],"given":[49],"its":[50],"average":[51],"encoding":[52,93],"degree,":[53],"which":[54],"logarithmic":[56],"dimension.":[60],"Moreover,":[61],"number":[63],"queries":[65],"needed":[66],"to":[67],"recover":[68],"any":[69],"symbol":[71],"at":[76],"most":[77],"2.":[78],"As":[79],"result,":[81],"our":[82],"first":[86],"family":[87],"codes":[90],"with":[91],"low":[92],"and":[94],"decoding":[95],"complexity.":[96]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
