{"id":"https://openalex.org/W2166015129","doi":"https://doi.org/10.1109/tit.2009.2039037","title":"Optimal Hash Functions for Approximate Matches on the $n$-Cube","display_name":"Optimal Hash Functions for Approximate Matches on the $n$-Cube","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2166015129","doi":"https://doi.org/10.1109/tit.2009.2039037","mag":"2166015129"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2009.2039037","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2039037","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/A5085783796","display_name":"Daniel M. Gordon","orcid":"https://orcid.org/0000-0003-4373-3637"},"institutions":[{"id":"https://openalex.org/I4210157118","display_name":"CCI Reprographics (United States)","ror":"https://ror.org/04d7j1v83","country_code":"US","type":"company","lineage":["https://openalex.org/I4210157118"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.M. Gordon","raw_affiliation_strings":["IDA Center for Communications Research, San Diego, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDA Center for Communications Research, San Diego, CA, USA","institution_ids":["https://openalex.org/I4210157118"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085804010","display_name":"Victor S. Miller","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V.S. Miller","raw_affiliation_strings":["IDA Center for Communications Research, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDA Center for Communications Research, Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023273263","display_name":"Peter Ostapenko","orcid":null},"institutions":[{"id":"https://openalex.org/I4210157118","display_name":"CCI Reprographics (United States)","ror":"https://ror.org/04d7j1v83","country_code":"US","type":"company","lineage":["https://openalex.org/I4210157118"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Ostapenko","raw_affiliation_strings":["IDA Center for Communications Research, San Diego, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDA Center for Communications Research, San Diego, CA, USA","institution_ids":["https://openalex.org/I4210157118"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4505,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.9082176,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"56","issue":"3","first_page":"984","last_page":"991"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7969955801963806},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5749572515487671},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5265898108482361},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5096449851989746},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.4975793659687042},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.46644115447998047},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46025407314300537},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4366295635700226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40459659695625305},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.37501397728919983},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36276859045028687},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.32237035036087036}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7969955801963806},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5749572515487671},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5265898108482361},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5096449851989746},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.4975793659687042},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.46644115447998047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46025407314300537},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4366295635700226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40459659695625305},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.37501397728919983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36276859045028687},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.32237035036087036},{"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2009.2039037","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2039037","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W609177099","https://openalex.org/W1502916507","https://openalex.org/W1976677460","https://openalex.org/W1989008275","https://openalex.org/W1989878512","https://openalex.org/W2009917512","https://openalex.org/W2014814022","https://openalex.org/W2021160321","https://openalex.org/W2034968281","https://openalex.org/W2058250873","https://openalex.org/W2063054346","https://openalex.org/W2116343079","https://openalex.org/W2142901448","https://openalex.org/W2145065594","https://openalex.org/W2147717514","https://openalex.org/W2148885851","https://openalex.org/W2178016547","https://openalex.org/W2245580057","https://openalex.org/W2252849054","https://openalex.org/W2488143187","https://openalex.org/W6629956336","https://openalex.org/W6682205557"],"related_works":["https://openalex.org/W1979795732","https://openalex.org/W1972853352","https://openalex.org/W2174348202","https://openalex.org/W2054549325","https://openalex.org/W1870428314","https://openalex.org/W1489218338","https://openalex.org/W2279770918","https://openalex.org/W2089632823","https://openalex.org/W2626013971","https://openalex.org/W2950026462"],"abstract_inverted_index":{"One":[0],"way":[1],"to":[2,9,44],"find":[3],"near-matches":[4],"in":[5],"large":[6],"datasets":[7],"is":[8,31],"use":[10],"hash":[11,17,33,49],"functions.":[12],"In":[13,38],"recent":[14],"years":[15],"locality-sensitive":[16],"functions":[18,50],"for":[19,25,56],"various":[20,47],"metrics":[21],"have":[22],"been":[23],"given;":[24],"the":[26],"Hamming":[27],"metric":[28],"projecting":[29],"onto$k$bits":[30],"simple":[32],"function":[34],"that":[35],"performs":[36],"well.":[37],"this":[39],"paper,":[40],"we":[41],"investigate":[42],"alternatives":[43],"projection.":[45,68],"For":[46],"parameters":[48],"given":[51],"by":[52],"complete":[53],"decoding":[54],"algorithms":[55],"error-correcting":[57],"codes":[58,64],"work":[59],"better,":[60],"and":[61],"asymptotically":[62],"random":[63],"perform":[65],"better":[66],"than":[67]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}