{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:15:13Z","timestamp":1729664113168,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034061","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2696-2700","source":"Crossref","is-referenced-by-count":4,"title":["Almost separating and almost secure frameproof codes"],"prefix":"10.1109","author":[{"given":"Marcel","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigory","family":"Kabatiansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Moreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.705568"},{"key":"ref3","article-title":"Asymptotic overview on separating codes","author":"cohen","year":"2003","journal-title":"Technical report no 248"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref6","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"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.915661"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809570"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0401035"},{"key":"ref2","first-page":"105","article-title":"Separating systems","volume":"30","author":"sagalovich","year":"1994","journal-title":"Problems of Information Transmission"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365239"},{"key":"ref1","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"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034061.pdf?arnumber=6034061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T03:35:27Z","timestamp":1497929727000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034061\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034061","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}