{"id":"https://openalex.org/W2122511149","doi":"https://doi.org/10.1109/isit.2009.5206019","title":"An optimal result for codes identifying sets of words","display_name":"An optimal result for codes identifying sets of words","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2122511149","doi":"https://doi.org/10.1109/isit.2009.5206019","mag":"2122511149"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5206019","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5206019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5022615833","display_name":"Svante Janson","orcid":"https://orcid.org/0000-0002-9680-2790"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Svante Janson","raw_affiliation_strings":["Department of Mathematics, University of Uppsala, Uppsala, Sweden","Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Uppsala, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Department of Mathematics, Uppsala University, P.O. Box 480, SE-751 06, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009028313","display_name":"Tero Laihonen","orcid":"https://orcid.org/0000-0002-2688-2166"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Tero Laihonen","raw_affiliation_strings":["Department of Mathematics, University of Turku, Turku, Finland","Dept of Mathematics, University of Turku, FIN-20014, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]},{"raw_affiliation_string":"Dept of Mathematics, University of Turku, FIN-20014, Finland","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022615833"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14783127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"2547","last_page":"2551"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9948999881744385,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9948999881744385,"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/T11130","display_name":"Coding theory and cryptography","score":0.9937999844551086,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9933000206947327,"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/set","display_name":"Set (abstract data type)","score":0.4741777181625366},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.42019155621528625},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4168260991573334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4047227203845978},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3492160439491272},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34881237149238586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24261334538459778},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13417387008666992}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4741777181625366},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.42019155621528625},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4168260991573334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4047227203845978},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3492160439491272},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34881237149238586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24261334538459778},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13417387008666992}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5206019","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5206019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W113781070","https://openalex.org/W1604469657","https://openalex.org/W1976667255","https://openalex.org/W2008048027","https://openalex.org/W2010696139","https://openalex.org/W2023364923","https://openalex.org/W2028229839","https://openalex.org/W2037020470","https://openalex.org/W2037219199","https://openalex.org/W2040878396","https://openalex.org/W2041065628","https://openalex.org/W2046202953","https://openalex.org/W2046561241","https://openalex.org/W2084325182","https://openalex.org/W2100994793","https://openalex.org/W2132014457","https://openalex.org/W2135472198","https://openalex.org/W2150495820","https://openalex.org/W2154298980","https://openalex.org/W2999073656","https://openalex.org/W6604644033"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2980963558","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378"],"abstract_inverted_index":{"In":[0,155,202],"this":[1,203,208],"paper,":[2,204],"we":[3,205],"consider":[4],"identifying":[5,19],"codes":[6,20,260],"in":[7],"binary":[8,199],"Hamming":[9],"spaces":[10],"F":[11,51,63,101,124],"<sup":[12,52,64,102,125,141,179,230,236],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[13,53,65,72,78,103,115,126,139,142,168,173,177,180,228,231,237],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[14,54,66,104,127],".":[15,55],"The":[16],"concept":[17],"of":[18,34,59,84,128,149,255],"was":[21],"introduced":[22],"by":[23,69,136],"Karpovsky,":[24],"Chakrabarty":[25],"and":[26,158,195,244,250],"Levitin.":[27],"Currently,":[28],"the":[29,82,111,145,198],"subject":[30],"forms":[31],"a":[32,47,97],"topic":[33],"its":[35],"own":[36],"with":[37],"several":[38],"possible":[39,147],"applications,":[40],"for":[41,120,161,211,240,261],"example,":[42],"to":[43],"sensor":[44],"networks.":[45],"Let":[46,133],"code":[48,98],"C":[49,99],"\u00bf":[50,62,94,100,108,123,152,162,191,192,214,215,218,219,243,258],"For":[56],"any":[57,212],"set":[58,83],"words":[60],"X":[61,122],",":[67],"denote":[68,135],"I":[70,76,113],"<sub":[71,77,114,138,167,172,176,227],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">r</sub>":[73,79,116,140,178,229],"(X)":[74,117],"=":[75,163,183,189,234,263],"(C;":[80],"X)":[81],"codewords":[85],"within":[86],"distance":[87],"r":[88,188,245,262],"from":[89],"at":[90,130],"least":[91],"one":[92],"x":[93],"X.":[95],"Now":[96],"is":[105,197],"called":[106],"(r,":[107,151,257],"\u00bf)-identifying":[109,153],"if":[110],"sets":[112],"are":[118],"distinct":[119],"all":[121],"size":[129],"most":[131],"\u00bf.":[132],"us":[134],"M":[137,175,226],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(\u00bf\u00bf)</sup>":[143,181,232],"(n)":[144,182,233],"smallest":[146],"cardinality":[148],"an":[150,252],"code.":[154],"2002,":[156],"Honkala":[157],"Lobstein":[159],"showed":[160],"1":[164,184,216],"that":[165,207,225],"lim":[166],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n\u00bf\u00bf</sub>":[169],"1/n":[170],"log":[171],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[174],"-":[185,265],"h(\u00bf)":[186],"where":[187],"[\u00bfn],":[190],"(0,":[193,220],"1)":[194],"h(x)":[196],"entropy":[200],"function.":[201],"prove":[206],"result":[209],"holds":[210],"fixed":[213,242],"when":[217],"1/2).":[221],"We":[222],"also":[223],"show":[224],"O(n":[235],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3/2</sup>":[238],")":[239],"every":[241],"slightly":[246],"less":[247],"than":[248],"n/2,":[249],"give":[251],"explicit":[253],"construction":[254],"small":[256],"2)-identifying":[259],"[n/2]":[264],"1.":[266]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}