{"id":"https://openalex.org/W1704831432","doi":"https://doi.org/10.1186/s13635-015-0026-8","title":"Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders","display_name":"Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders","publication_year":2016,"publication_date":"2016-01-04","ids":{"openalex":"https://openalex.org/W1704831432","doi":"https://doi.org/10.1186/s13635-015-0026-8","mag":"1704831432"},"language":"en","primary_location":{"id":"doi:10.1186/s13635-015-0026-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13635-015-0026-8","pdf_url":"https://jis-eurasipjournals.springeropen.com/track/pdf/10.1186/s13635-015-0026-8","source":{"id":"https://openalex.org/S5820498","display_name":"EURASIP Journal on Information Security","issn_l":"1687-4161","issn":["1687-4161","1687-417X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURASIP Journal on Information Security","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://jis-eurasipjournals.springeropen.com/track/pdf/10.1186/s13635-015-0026-8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Thijs Laarhoven","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Thijs Laarhoven","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":840,"currency":"EUR","value_usd":1040},"apc_paid":{"value":840,"currency":"EUR","value_usd":1040},"fwci":0.4498,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65897742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2016","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11754","display_name":"SARS-CoV-2 detection and testing","score":0.9520000219345093,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T11754","display_name":"SARS-CoV-2 detection and testing","score":0.9520000219345093,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.004800000227987766,"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/T10986","display_name":"RFID technology advancements","score":0.004100000020116568,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7924000024795532},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7520999908447266},{"id":"https://openalex.org/keywords/soft-decision-decoder","display_name":"Soft-decision decoder","score":0.7303000092506409},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.6976000070571899},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5784000158309937},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.5519000291824341},{"id":"https://openalex.org/keywords/joint","display_name":"Joint (building)","score":0.4934000074863434}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7924000024795532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7610999941825867},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7520999908447266},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.7303000092506409},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.6976000070571899},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5784000158309937},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.5519000291824341},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5403000116348267},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.4934000074863434},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41499999165534973},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.3935999870300293},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C177580056","wikidata":"https://www.wikidata.org/wiki/Q5611272","display_name":"Group testing","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.27480000257492065},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.2572000026702881}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1186/s13635-015-0026-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13635-015-0026-8","pdf_url":"https://jis-eurasipjournals.springeropen.com/track/pdf/10.1186/s13635-015-0026-8","source":{"id":"https://openalex.org/S5820498","display_name":"EURASIP Journal on Information Security","issn_l":"1687-4161","issn":["1687-4161","1687-417X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURASIP Journal on Information Security","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1404.2825","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1404.2825","pdf_url":"https://arxiv.org/pdf/1404.2825","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:openaire/e453dd05-c880-462a-a8de-a42ee858f83f","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/e453dd05-c880-462a-a8de-a42ee858f83f","pdf_url":"https://pure.tue.nl/ws/files/15731422/LaarhovenAsymptotics2016.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laarhoven, T 2016, 'Asymptotics of fingerprinting and group testing : capacity-achieving log-likelihood decoders', EURASIP Journal on Information Security, vol. 2016, no. 1, 3. https://doi.org/10.1186/s13635-015-0026-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/e453dd05-c880-462a-a8de-a42ee858f83f","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/e453dd05-c880-462a-a8de-a42ee858f83f","pdf_url":"https://research.tue.nl/nl/publications/e453dd05-c880-462a-a8de-a42ee858f83f","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURASIP Journal on Information Security, 2016(1):3. Springer Open","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/e453dd05-c880-462a-a8de-a42ee858f83f","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84952909909&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laarhoven, T 2016, 'Asymptotics of fingerprinting and group testing : capacity-achieving log-likelihood decoders', EURASIP Journal on Information Security, vol. 2016, no. 1, 3. https://doi.org/10.1186/s13635-015-0026-8","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1186/s13635-015-0026-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13635-015-0026-8","pdf_url":"https://jis-eurasipjournals.springeropen.com/track/pdf/10.1186/s13635-015-0026-8","source":{"id":"https://openalex.org/S5820498","display_name":"EURASIP Journal on Information Security","issn_l":"1687-4161","issn":["1687-4161","1687-417X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURASIP Journal on Information Security","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1704831432.pdf","grobid_xml":"https://content.openalex.org/works/W1704831432.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W1546210593","https://openalex.org/W1546855683","https://openalex.org/W1968422945","https://openalex.org/W1969848549","https://openalex.org/W1975680434","https://openalex.org/W1977832049","https://openalex.org/W1986979839","https://openalex.org/W1996446882","https://openalex.org/W2008885927","https://openalex.org/W2010291444","https://openalex.org/W2019964557","https://openalex.org/W2039632567","https://openalex.org/W2043475513","https://openalex.org/W2043584522","https://openalex.org/W2049745577","https://openalex.org/W2068033507","https://openalex.org/W2083594366","https://openalex.org/W2087879325","https://openalex.org/W2091887150","https://openalex.org/W2092811336","https://openalex.org/W2101627389","https://openalex.org/W2114425841","https://openalex.org/W2128757012","https://openalex.org/W2131267390","https://openalex.org/W2134195444","https://openalex.org/W2134864073","https://openalex.org/W2145102561","https://openalex.org/W2152572810","https://openalex.org/W2155658392","https://openalex.org/W2159716457","https://openalex.org/W2168868689","https://openalex.org/W2171949331","https://openalex.org/W2544969453","https://openalex.org/W2949732801","https://openalex.org/W2993330478","https://openalex.org/W4234511798"],"related_works":[],"abstract_inverted_index":{"We":[0,24,54],"study":[1],"the":[2,21,50,57,63,86,91,100,106,125,138,146,165,172,176,186,196,211,217],"large-coalition":[3],"asymptotics":[4],"of":[5,20,99,141,151,188,203],"fingerprinting":[6],"and":[7,10,40,69,72,123,145,158,192],"group":[8,170,198,209],"testing":[9,199],"derive":[11],"explicit":[12],"decoders":[13,30,43,94,154,214],"that":[14,84,161],"provably":[15,95,194],"achieve":[16,49,96,164,216],"capacity":[17],"for":[18,28,41,77,175],"many":[19],"considered":[22],"models.":[23],"do":[25],"this":[26,204],"both":[27,78],"simple":[29,173,197,213,219],"(which":[31,44],"are":[32,155],"fast":[33],"but":[34,48],"commonly":[35],"require":[36],"larger":[37],"code":[38,52],"lengths)":[39],"joint":[42,167],"may":[45],"be":[46,113,134,182],"slower":[47],"best":[51],"lengths).":[53],"further":[55,110],"make":[56],"distinction":[58],"between":[59],"informed":[60],"decoding,":[61,71],"where":[62],"pirate":[64,87],"strategy":[65,88],"is":[66,89,109,131,179],"exactly":[67],"known,":[68,90],"uninformed":[70,126],"we":[73,82,159],"design":[74],"decoding":[75],"schemes":[76],"settings.":[79],"For":[80,169,201],"fingerprinting,":[81],"show":[83],"if":[85],"Neyman-Pearson-based":[92],"log-likelihood":[93],"capacity,":[97],"regardless":[98],"strategy.":[101],"The":[102],"decoder":[103,130,140,150,174],"built":[104],"against":[105],"interleaving":[107],"attack":[108],"shown":[111,132,180],"to":[112,118,133,137,181],"a":[114],"universal":[115,129],"decoder,":[116],"able":[117],"deal":[119],"with":[120],"arbitrary":[121],"attacks":[122],"achieving":[124],"capacity.":[127,200],"This":[128],"closely":[135],"related":[136],"Lagrange-optimized":[139],"Oosterwijk":[142],"et":[143,190],"al.":[144,191],"empirical":[147],"mutual":[148],"information":[149],"Moulin.":[152],"Joint":[153],"also":[156,163,215],"proposed,":[157],"conjecture":[160],"these":[162],"corresponding":[166,218],"capacities.":[168,220],"testing,":[171,210],"classical":[177],"model":[178,205],"more":[183],"efficient":[184],"than":[185],"one":[187],"Chan":[189],"it":[193],"achieves":[195],"generalizations":[202],"such":[206],"as":[207],"noisy":[208],"resulting":[212]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}