{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:26:08Z","timestamp":1745209568500},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401117"},{"type":"electronic","value":"9783540448280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44828-4_9","type":"book-chapter","created":{"date-parts":[[2007,11,18]],"date-time":"2007-11-18T06:09:54Z","timestamp":1195366194000},"page":"71-78","source":"Crossref","is-referenced-by-count":6,"title":["Fighting Two Pirates"],"prefix":"10.1007","author":[{"given":"Hans Georg","family":"Schaathun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,4,30]]},"reference":[{"key":"9_CR1","unstructured":"A. Barg, G.R. Blakley, and G. Kabatiansky. Good digital fingerprinting Codes. Technical report, DIMACS, 2001."},{"issue":"5","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D. Boneh","year":"1998","unstructured":"Dan Boneh and James Shaw. Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory, 44(5):1897\u20131905, 1998. Presented in part 1995, see Springer LNCS.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"9_CR3","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TC.1980.1675640","volume":"29","author":"B. Bose","year":"1980","unstructured":"Bella Bose and T.R.N. Rao. Separating and completely separating systems and linear Codes. IEEE Trans. Comput., 29(7):665\u2013668, 1980.","journal-title":"IEEE Trans. Comput."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/18.340462","volume":"40","author":"G. Cohen","year":"1994","unstructured":"G\u00e9rard Cohen and Gilles Zemor. Intersecting Codes and independent families. IEEE Trans. Inform. Theory, 40:1872\u20131881, 1994.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"G\u00e9rard D. Cohen, Sylvia B. Encheva, Simon Litsyn, and Hans Georg Schaathun. Intersecting Codes and separating Codes. Discrete Applied Mathematics, 2001. To appear.","DOI":"10.1016\/S1571-0653(04)00172-6"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/T-C.1969.222707","volume":"18","author":"A.D. Friedman","year":"1969","unstructured":"A.D. Friedman, R.L. Graham, and J.D. Ullman. Universal single transition time asynchronous state assignments. IEEE Trans. Comput., 18:541\u2013547, 1969.","journal-title":"IEEE Trans. Comput."},{"key":"9_CR7","unstructured":"Jacob L\u00f6fvenberg. Codes for Digital Fingerprinting. PhD thesis, Link\u00f6pings Universitet, 2001. http:\/\/www.it.isy.liu.se\/publikationer\/index.html ."},{"issue":"2","key":"9_CR8","first-page":"27","volume":"1","author":"Yu.L. Sagalovich","year":"1965","unstructured":"Yu.L. Sagalovich. A method for increasing the reliability of finite automata. Problems of Information Transmission, 1(2):27\u201335, 1965.","journal-title":"Problems of Information Transmission"},{"issue":"2","key":"9_CR9","first-page":"105","volume":"30","author":"Yu.L. Sagalovich","year":"1994","unstructured":"Yu.L. Sagalovich. Separating systems. Problems of Information Transmission, 30(2):105\u2013123, 1994.","journal-title":"Problems of Information Transmission"},{"issue":"1\u20133","key":"9_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0166-218X(91)90120-L","volume":"33","author":"M. A. Tsfasman","year":"1991","unstructured":"Michael A. Tsfasman. Algebraic-geometric Codes and asymptotic Problems. Discrete Appl. Math., 33(1\u20133):241\u2013256, 1991. Applied algebra, algebraic algorithms, and error-correcting codes (Toulouse, 1989).","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44828-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T17:46:56Z","timestamp":1556992016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44828-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401117","9783540448280"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44828-4_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}