{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:43:20Z","timestamp":1775054600318,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001691","name":"JSPS Grant-in-Aid for Scientific Research","doi-asserted-by":"publisher","award":["18H01133"],"award-info":[{"award-number":["18H01133"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/tit.2020.3033445","type":"journal-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T19:51:15Z","timestamp":1603482675000},"page":"200-216","source":"Crossref","is-referenced-by-count":20,"title":["Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9500-7146","authenticated-orcid":false,"given":"Jinping","family":"Fan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4078-2302","authenticated-orcid":false,"given":"Yujie","family":"Gu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3994-5533","authenticated-orcid":false,"given":"Masahiro","family":"Hachimori","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9086-8668","authenticated-orcid":false,"given":"Ying","family":"Miao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1155\/9789775945181"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(72)90052-2"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2945948"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2331989"},{"key":"ref30","first-page":"169","volume":"25","author":"f\u00fcredi","year":"2013","journal-title":"The history of degenerate (bipartite) extremal graph problems"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80038-4"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00717-y"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0050-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90018-7"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90183-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0052"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205886"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513761"},{"key":"ref20","first-page":"103","article-title":"Improvement of the code-length lower bound for a multiple-access adder channel","volume":"19","author":"d\u2019yachkov","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541858"},{"key":"ref21","first-page":"301","article-title":"On a lower bound to the length of B4-codes","volume":"10","author":"d\u2019yachkov","year":"1981","journal-title":"Problems Control Inf Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90004-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0551-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-16.4.212"},{"key":"ref25","first-page":"215","article-title":"On a problem in graph theory","volume":"1","author":"erd?s","year":"1966","journal-title":"Studia Sci Math Hungar"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0203-x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00296-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9849-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146130"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130107"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3127"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01609874"},{"key":"ref16","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref17","article-title":"Lectures on designing screening experiments","author":"d\u2019yachkov","year":"2014","journal-title":"arXiv 1401 7505"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2893234"},{"key":"ref19","first-page":"26","article-title":"A coding model for a multiple-access adder channel","volume":"17","author":"d\u2019yachkov","year":"1981","journal-title":"Probl Peredachi Inf"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101384633"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9673-7"},{"key":"ref6","author":"bollob\u00e1s","year":"2004","journal-title":"Extremal Graph Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2473848"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02558476"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2003.809378"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.705568"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2197812"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2745619"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/18.959283"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196304246"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(99)00131-7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305007029"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.59923"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(75)90007-2"},{"key":"ref43","article-title":"Two-level fingerprinting codes: Non-trivial constructions","author":"rochanakul","year":"2011","journal-title":"arXiv 1108 6197"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9300279\/09237979.pdf?arnumber=9237979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:24Z","timestamp":1652194464000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9237979\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":49,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3033445","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}