{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T06:41:42Z","timestamp":1720334502493},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.ipl.2023.106365","type":"journal-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T21:34:50Z","timestamp":1674682490000},"page":"106365","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Bounds and algorithms for generalized superimposed codes"],"prefix":"10.1016","volume":"182","author":[{"given":"Adele A.","family":"Rescigno","sequence":"first","affiliation":[]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ipl.2023.106365_br0010","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0895480103431071","article-title":"Learning a hidden subgraph","volume":"18","author":"Alon","year":"2005","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ipl.2023.106365_br0020","series-title":"Genetic Mapping and DNA Sequencing","first-page":"133","article-title":"A comparative survey of non-adaptive pooling design","author":"Balding","year":"1996"},{"issue":"30","key":"10.1016\/j.ipl.2023.106365_br0030","doi-asserted-by":"crossref","first-page":"E2752","DOI":"10.1073\/pnas.1216318110","article-title":"Single-photon sampling architecture for solid-state imaging sensors","volume":"110","author":"van den Berg","year":"2013","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.ipl.2023.106365_br0040","series-title":"DISC 1999","first-page":"140","article-title":"Randomness recycling in constant-round private computations","volume":"vol. 1693","author":"Blundo","year":"1999"},{"key":"10.1016\/j.ipl.2023.106365_br0050","series-title":"Algorithms and Complexity. CIAC 2015","first-page":"74","article-title":"Linear time constructions of some d-restriction problems","volume":"vol. 9079","author":"Bshouty","year":"2015"},{"key":"10.1016\/j.ipl.2023.106365_br0060","series-title":"Proceedings of STOC'96","first-page":"30","article-title":"Deterministic restrictions in circuit complexity","author":"Chaudhuri","year":"1996"},{"key":"10.1016\/j.ipl.2023.106365_br0070","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s11590-008-0109-2","article-title":"On the upper bounds of the minimum number of rows of disjunct matrices","volume":"3","author":"Cheng","year":"2009","journal-title":"Opt. Lett."},{"issue":"1\u20133","key":"10.1016\/j.ipl.2023.106365_br0080","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0304-3975(02)00851-4","article-title":"Distributed broadcast in radio networks of unknown topology","volume":"302","author":"Clementi","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2023.106365_br0090","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.jcss.2009.06.002","article-title":"Pattern matching with don't cares and few errors","volume":"76","author":"Clifford","year":"2010","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ipl.2023.106365_br0100","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/B:DESI.0000029213.74879.e0","article-title":"Cover-free families and topology-transparent scheduling in MANETs","volume":"32","author":"Colbourn","year":"2004","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ipl.2023.106365_br0120","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0304-3975(03)00281-0","article-title":"Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels","volume":"306","author":"De Bonis","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2023.106365_br0130","series-title":"Pooling Design and Nonadaptive Group Testing","author":"Du","year":"2006"},{"issue":"3","key":"10.1016\/j.ipl.2023.106365_br0140","first-page":"7","article-title":"Bounds on the length of disjunct codes","volume":"18","author":"D'yachkov","year":"1982","journal-title":"Probl. Pereda. Inf."},{"key":"10.1016\/j.ipl.2023.106365_br0150","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u00f6s","year":"1985","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.ipl.2023.106365_br0160","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/jcta.1996.0012","article-title":"On r-cover-free families","volume":"73","author":"F\u00fcredi","year":"1996","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"5","key":"10.1016\/j.ipl.2023.106365_br0170","doi-asserted-by":"crossref","first-page":"2760","DOI":"10.1109\/TIT.2019.2891651","article-title":"Nearly optimal sparse group testing","volume":"65","author":"Gandikota","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ipl.2023.106365_br0180","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.tcs.2019.10.032","article-title":"Low-weight superimposed codes and related combinatorial structures: bounds and applications","volume":"806","author":"Gargano","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.ipl.2023.106365_br0190","first-page":"154","article-title":"One-bit compressed sensing: provable support and vector recovery","volume":"28","author":"Gopi","year":"2013","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"10.1016\/j.ipl.2023.106365_br0200","doi-asserted-by":"crossref","first-page":"2729","DOI":"10.1109\/TIT.2019.2951703","article-title":"Sparse combinatorial group testing","volume":"66","author":"Inan","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ipl.2023.106365_br0210","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Nonrandom binary superimposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ipl.2023.106365_br0220","series-title":"CRYPTO' 99","first-page":"609","article-title":"Coding constructions for blacklisting problems without computational assumptions","volume":"vol. 1666","author":"Kumar","year":"1999"},{"issue":"1","key":"10.1016\/j.ipl.2023.106365_br0230","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0221015","article-title":"Locality in distributed graph algorithms","volume":"21","author":"Linial","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ipl.2023.106365_br0240","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0166-218X(97)80002-9","article-title":"Error-correcting nonadaptive group de-disjunct matrices","volume":"80","author":"Macula","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ipl.2023.106365_br0250","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.tcs.2015.04.027","article-title":"On the complexity of neighbourhood learning in radio networks","volume":"608","author":"Miller","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2023.106365_br0260","doi-asserted-by":"crossref","DOI":"10.1145\/1667053.1667060","article-title":"A constructive proof of the general Lov\u00e1sz local lemma","volume":"57","author":"Moser","year":"2010","journal-title":"J. ACM"},{"key":"10.1016\/j.ipl.2023.106365_br0270","doi-asserted-by":"crossref","first-page":"7982","DOI":"10.1109\/TIT.2011.2163296","article-title":"Explicit non-adaptive combinatorial group testing schemes","volume":"57","author":"Porat","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ipl.2023.106365_br0280","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","article-title":"On the upper bound of the size of the r-cover-free families","volume":"66","author":"Ruszink\u00f3","year":"1994","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.ipl.2023.106365_br0290","series-title":"Hash Families and Cover-Free Families with Cryptographic Applications","author":"Zaverucha","year":"2010"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001902300008X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001902300008X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:41:52Z","timestamp":1684284112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001902300008X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":28,"alternative-id":["S002001902300008X"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106365","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bounds and algorithms for generalized superimposed codes","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106365","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106365"}}
