{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:15:24Z","timestamp":1649117724131},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2020,5,1]]},"DOI":"10.1587\/transinf.2019edl8187","type":"journal-article","created":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T22:13:53Z","timestamp":1588284833000},"page":"1164-1167","source":"Crossref","is-referenced-by-count":0,"title":["A New Upper Bound for Finding Defective Samples in Group Testing"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Jin-Taek","family":"SEONG","sequence":"first","affiliation":[{"name":"Department of Convergence Software, Mokpo National University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] R. Dorfman, \u201cThe Detection of Defective Members of Large Populations,\u201d The Annals of Mathematical Statistics, vol.14, no.4, pp.436-440, Dec. 1943. 10.1214\/aoms\/1177731363","DOI":"10.1214\/aoms\/1177731363"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D.L. Donoho, \u201cCompressed Sensing,\u201d IEEE Trans. Inf. Theory, vol.52, no.4, pp.1289-1306, April 2006. 10.1109\/TIT.2006.871582","DOI":"10.1109\/TIT.2006.871582"},{"key":"3","unstructured":"[3] D.-Z. Du and F.-K. Hwang, Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Sequencing, World Scientific, 2006. 10.1142\/6122"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T. Laarhoven, \u201cEfficient probabilistic group testing based on traitor tracing,\u201d 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, Oct. 2013. 10.1109\/Allerton.2013.6736699","DOI":"10.1109\/Allerton.2013.6736699"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S.K. Bar-Lev, O. Boxma, I. Kleiner, D. Perry, and W. Stadje, \u201cRecycled incomplete identification procedures for blood screening,\u201d European Journal of Operational Research, vol.259, no.1, pp.330-343, May 2017. 10.1016\/j.ejor.2016.10.005","DOI":"10.1016\/j.ejor.2016.10.005"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S.K. Bar-Lev, A. Boneh, and D. Perry, \u201cIncomplete identification models for group-testable items,\u201d Naval Research Logistics, vol.37, no.5, pp.647-659, Oct. 1990.","DOI":"10.1002\/1520-6750(199010)37:5<647::AID-NAV3220370505>3.0.CO;2-6"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] V. Ganditota, E. Grigorescu, S. Jaggi, and S. Zhou, \u201cNearly Optimal Sparse Group Testing,\u201d IEEE Trans. Inf. Theory, vol.65, no.5, pp.2760-2773, May 2019. 10.1109\/TIT.2019.2891651","DOI":"10.1109\/TIT.2019.2891651"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] C.L. Chan, P.H. Che, S. Jaggi, and V. Saligrama, \u201cNon-adaptive probabilistic group testing with noisy measurements: near-optimal bounds with efficient algorithms,\u201d 49th Annual Allerton Conference on Communication, Control, and Computing, pp.1832-1839. Sept. 2011. 10.1109\/Allerton.2011.6120391","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] J. Scarlett, \u201cNoisy Adaptive Group Testing: Bounds and Algorithms,\u201d IEEE Trans. Inf. Theory, vol.65, no.6, pp.3646-3661, June 2019. 10.1109\/TIT.2018.2883604","DOI":"10.1109\/TIT.2018.2883604"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] G.K. Atia and V. Saligrama, \u201cBoolean compressed sensing and noisy group testing,\u201d IEEE Trans. Inf. Theory, vol.58, no.3, pp.1880-1901, March 2012. 10.1109\/TIT.2011.2178156","DOI":"10.1109\/TIT.2011.2178156"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] T. Wadayama, \u201cNonadaptive Group Testing Based on Sparse Pooling Graphs,\u201d IEEE Trans. Inf. Theory, vol.63, no.3, pp.1525-1534, March 2017. 10.1109\/TIT.2016.2621112","DOI":"10.1109\/TIT.2016.2621112"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] C. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, \u201cNon-Adaptive Group Testing: Explicit Bounds and Novel Algorithms,\u201d IEEE Trans. Inf. Theory, vol.60, no.5, pp.3019-3035, May 2014. 10.1109\/TIT.2014.2310477","DOI":"10.1109\/TIT.2014.2310477"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] M. Aldridge, L. Baldassini, and O. Johnson, \u201cGroup Testing Algorithms: Bounds and Simulations,\u201d IEEE Trans. Inf. Theory, vol.60, no.6, pp.3671-3687, June 2014. 10.1109\/TIT.2014.2314472","DOI":"10.1109\/TIT.2014.2314472"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] O. Johnson, M. Aldridge, and J. Scarlett, \u201cPerformance of group testing algorithms with near-constant tests per item,\u201d IEEE Trans. Inf. Theory, vol.65, no.2, pp.707-723, Feb. 2019. 10.1109\/TIT.2018.2861772","DOI":"10.1109\/TIT.2018.2861772"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] J.T. Seong, \u201cDensity of Pooling Matrices vs. Sparsity of Signals for Group Testing Problems,\u201d IEICE Trans. Inf. &amp; Syst., vol.E102-D, no.5, pp.1081-1084, May 2019. 10.1587\/transinf.2018EDL8200","DOI":"10.1587\/transinf.2018EDL8200"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/5\/E103.D_2019EDL8187\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T06:38:43Z","timestamp":1588833523000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/5\/E103.D_2019EDL8187\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,1]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019edl8187","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,1]]}}}