{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:49:18Z","timestamp":1774680558921,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Natural Sciences and Engineering Research Council of Canada Scholarship"},{"name":"National Science Foundation","award":["CIF 1218764"],"award-info":[{"award-number":["CIF 1218764"]}]},{"name":"National Science Foundation","award":["CIF 1117980"],"award-info":[{"award-number":["CIF 1117980"]}]},{"name":"Science and Technology Center Class 2010","award":["CCF 0939370"],"award-info":[{"award-number":["CCF 0939370"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/tit.2014.2327630","type":"journal-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:24:57Z","timestamp":1401474297000},"page":"4614-4636","source":"Crossref","is-referenced-by-count":27,"title":["Semiquantitative Group Testing"],"prefix":"10.1109","volume":"60","author":[{"given":"Amin","family":"Emad","sequence":"first","affiliation":[]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1093\/hmg\/ddl057"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.genom.6.080604.162309"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016024"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2007.4497985"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2003.1227307"},{"key":"ref30","year":"0"},{"key":"ref37","article-title":"Determining subsets by unramified experiments","author":"lindstr\u00f6m","year":"1975","journal-title":"A Survey of Statistical Designs and Linear Models"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158565"},{"key":"ref35","first-page":"2011","article-title":"T-user code with arbitrary code length for multiple-access adder channel","volume":"e82 a","author":"cheng","year":"1999","journal-title":"IEICE Trans Fundamentals"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194265623"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283597"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/162824"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkq675"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth1154"},{"key":"ref2","first-page":"69","article-title":"Packet communication on a channel without feedback","volume":"19","author":"tsybakov","year":"1983","journal-title":"Problems Inform Transmiss"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283599"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1975.10480324"},{"key":"ref22","article-title":"Generalized superimposed codes and their application to random multiple access","author":"d\u2019yachkov","year":"1984","journal-title":"Proc 6th Int Symp Inf Theory"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/11889342_45","article-title":"Threshold group testing","volume":"4123","author":"damaschke","year":"2006","journal-title":"General Theory of Information Transfer and Combinatorics (Lecture Notes in Computer Science)"},{"key":"ref24","article-title":"Lectures on designing screening experiments","author":"d\u2019yachkov","year":"2004"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1142\/6122","author":"du","year":"2006","journal-title":"Pooling Designs and Nonadaptive Group Testing"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2037043"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref51","first-page":"1","article-title":"Superimposed coding for iterative detection of DNA microarray spot failures","author":"huang","year":"2008","journal-title":"Proc IEEE Int Workshop Genomic Signal Process Statist"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288622"},{"key":"ref58","first-page":"1832","article-title":"Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms","author":"lam","year":"2011","journal-title":"Proc 49th Annu Allerton Conf Commun"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/SIBIRCON.2010.5555301"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894088"},{"key":"ref55","first-page":"464","article-title":"Extended minsum algorithm for decoding LDPC codes over GFq","author":"declercq","year":"2005","journal-title":"Proc IEEE ISIT"},{"key":"ref54","first-page":"1081","article-title":"Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording","volume":"39","author":"song","year":"2003","journal-title":"IEEE Trans Inf Theory"},{"key":"ref53","first-page":"96","article-title":"Fast min-sum algorithms for decoding of LDPC over GFq","author":"huang","year":"2006","journal-title":"Proc IEEE ITW"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809570"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.3934\/amc.2009.3.273","article-title":"Bounds and constructions for key distribution schemes","volume":"3","author":"desmedt","year":"2009","journal-title":"Adv Math Commun"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1101\/gr.3677206"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.03.008"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316529836","author":"assmus","year":"1992","journal-title":"Designs and their Codes"},{"key":"ref14","author":"macwilliams","year":"1991","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref15","first-page":"26","article-title":"A coding model for a multiple-access adder channel","volume":"17","author":"d\u2019yachkov","year":"1981","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.259654"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref18","first-page":"239","article-title":"Finite and infinite models for generalized group testing with unequal probability of success for each item","author":"nebenzahl","year":"0","journal-title":"Discriminant Analysis and Applications"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1974.10480142"},{"key":"ref4","article-title":"Superimposed codes for the Euclidean channel","author":"anderson","year":"1994"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057026"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.391266"},{"key":"ref8","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0053-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.38"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00287-5"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2002.3257"},{"key":"ref48","article-title":"Improved constructions for non-adaptive threshold group testing","author":"cheraghchi","year":"2010","journal-title":"Proc 37th Int Colloq Automata Lang Program"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9067-3"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2005.12.1129"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)80002-9"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.003"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF02566968"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6851961\/06823721.pdf?arnumber=6823721","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:16:00Z","timestamp":1642004160000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6823721\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":60,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2327630","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}