{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:41:44Z","timestamp":1773376904070,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000646","name":"Japan Society for the Promotion of Science (JSPS)","doi-asserted-by":"publisher","award":["21K13830,24K20736,24K06824"],"award-info":[{"award-number":["21K13830,24K20736,24K06824"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (NSFC)","doi-asserted-by":"publisher","award":["12101414"],"award-info":[{"award-number":["12101414"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619594","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"3237-3242","source":"Crossref","is-referenced-by-count":0,"title":["List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing"],"prefix":"10.1109","author":[{"given":"Jinping","family":"Fan","sequence":"first","affiliation":[{"name":"Shanghai Normal University,Shanghai,China"}]},{"given":"Yujie","family":"Gu","sequence":"additional","affiliation":[{"name":"Kyushu University,Fukuoka,Japan"}]},{"given":"Ying","family":"Miao","sequence":"additional","affiliation":[{"name":"University of Tsukuba,Ibaraki,Japan"}]},{"given":"Zhebin","family":"Yu","sequence":"additional","affiliation":[{"name":"Hitachi Astemo, Ltd.,Ibaraki,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00115"},{"issue":"#R39","key":"ref5","first-page":"581","article-title":"New bounds for union-free families of sets","volume":"5","author":"Coppersmith","year":"1998","journal-title":"Electronic Journal of Combinatorics"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/1936"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1142\/SAM"},{"key":"ref9","article-title":"Lectures on Designing Screening Experiments","author":"Dyachkov","year":"2014","journal-title":"preprint"},{"issue":"3","key":"ref10","first-page":"166","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"Dyachkov","year":"1982","journal-title":"Problems of Information Transmission"},{"issue":"4","key":"ref11","first-page":"18","article-title":"On the application of codes for multiple access channel to ALOHA-system","volume":"12","author":"Dyachkov","year":"1981","journal-title":"6th All-Union Seminar on Computer Networks"},{"issue":"4","key":"ref12","first-page":"229","article-title":"A survey of superimposed code theory","volume":"12","author":"Dyachkov","year":"1983","journal-title":"Problems of Control and Information Theory"},{"issue":"4","key":"ref13","first-page":"237","article-title":"Superimposed distance codes","volume":"18","author":"Dyachkov","year":"1989","journal-title":"Problems of Control and Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875252"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90004-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.11.022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(84)80025-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3301037"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0050-1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00717-y"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/055\/13"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3233395"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/REDUNDANCY52534.2021.9606449"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057026"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619594.pdf?arnumber=10619594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:08Z","timestamp":1773347348000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619594\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619594","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}