{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:13:39Z","timestamp":1729635219458,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/wifs.2011.6123141","type":"proceedings-article","created":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T22:03:26Z","timestamp":1326319406000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Lower bounds on almost-separating binary codes"],"prefix":"10.1109","author":[{"given":"Jose","family":"Moreira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigory","family":"Kabatiansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Fernandez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"13","DOI":"10.1137\/0401035"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/18.782097"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/TIT.2003.809570"},{"key":"12","first-page":"59","article-title":"Lower bound on the cardinality of code of automata's states","volume":"8","author":"pinsker","year":"1972","journal-title":"Problems of Information Transmission"},{"year":"2003","author":"cohen","journal-title":"Asymptotic Overview on Separating Codes","key":"3"},{"key":"2","first-page":"105","article-title":"Separating systems","volume":"30","author":"sagalovich","year":"1994","journal-title":"Problems of Information Transmission"},{"key":"1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/T-C.1969.222707","article-title":"universal single transition time asynchronous state assignments","volume":"c 18","author":"friedman","year":"1969","journal-title":"IEEE Transactions on Computers"},{"year":"2006","author":"cover","journal-title":"Elements of Information Theory","key":"10"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1007\/3-540-48658-5_25"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/18.915661"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/18.705568"},{"key":"4","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/3-540-44750-4_36","article-title":"Collusion-secure fingerprinting for digital data","volume":"963","author":"boneh","year":"1995","journal-title":"Lecture Notes Comput Sci (LNCS)"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/ISIT.2011.6034061"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/18.841169"}],"event":{"name":"2011 IEEE International Workshop on Information Forensics and Security (WIFS)","start":{"date-parts":[[2011,11,29]]},"location":"Iguacu Falls, Brazil","end":{"date-parts":[[2011,12,2]]}},"container-title":["2011 IEEE International Workshop on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6112284\/6123119\/06123141.pdf?arnumber=6123141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T12:37:03Z","timestamp":1497962223000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6123141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/wifs.2011.6123141","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}