{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:05:39Z","timestamp":1770833139044,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T00:00:00Z","timestamp":1427414400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10623-015-0060-z","type":"journal-article","created":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T12:26:25Z","timestamp":1427459185000},"page":"11-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Almost separating and almost secure frameproof codes over $$q$$ q -ary alphabets"],"prefix":"10.1007","volume":"80","author":[{"given":"Jos\u00e9","family":"Moreira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigory","family":"Kabatiansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,27]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Barg A., Blakley G.R., Kabatiansky G.: Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4), 852\u2013865 (2003).","DOI":"10.1109\/TIT.2003.809570"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Blakley G.R., Kabatiansky G.: Random coding technique for digital fingerprinting codes: fighting two pirates revisited. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), p. 203. IEEE, Chicago (2004).","DOI":"10.1109\/ISIT.2004.1365239"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. In: Proceedings of the International Cryptology Conference (CRYPTO), Santa Barbara. Lecture Notes in Computer Science, vol. 963, pp. 452\u2013465. Springer, Berlin (1995).","DOI":"10.1007\/3-540-44750-4_36"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44(5), 1897\u20131905 (1998).","DOI":"10.1109\/18.705568"},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"Chor B., Fiat A., Naor M.: Tracing traitors. In: Proceedings International Cryptology Conference on Advances in Cryptology (CRYPTO), Santa Barbara. Lecture Notes Computer Science, vol. 839, pp. 480\u2013491. Springer, Berlin (1994).","DOI":"10.1007\/3-540-48658-5_25"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Chor B., Fiat A., Naor M., Pinkas B.: Tracing traitors. IEEE Trans. Inf. Theory 46(3), 893\u2013910 (2000).","DOI":"10.1109\/18.841169"},{"key":"60_CR7","unstructured":"Cohen G.D., Schaathun H.G.: Asymptotic overview on separating codes. Technical Report 248, Deptartment of Informatics, University of Bergen, Norway (2003)."},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"Cohen G.D., Schaathun H.G.: Upper bounds on separating codes. IEEE Trans. Inf. Theory 50(6), 1291\u20131294 (2004).","DOI":"10.1109\/TIT.2004.828140"},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Csisz\u00e1r I., K\u00f6rner J.: Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. Cambridge University Press, Cambridge (2011).","DOI":"10.1017\/CBO9780511921889"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez M., Kabatiansky G., Moreira J.: Almost separating and almost secure frameproof codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 2696\u20132700. IEEE, Saint Petersburg (2011).","DOI":"10.1109\/ISIT.2011.6034061"},{"key":"60_CR11","unstructured":"Forney G.D.: Concatenated codes. Technical Repot 440, Research Laboratory of Electronics, MIT, Cambridge, MA (1966)."},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"Friedman A.D., Graham R.L., Ullman J.D.: Universal single transition time asynchronous state assignments. IEEE Trans. Comput. 18(6), 541\u2013547 (1969).","DOI":"10.1109\/T-C.1969.222707"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Guruswami V., Sudan M.: Improved decoding of Reed\u2013Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45(6), 1757\u20131767 (1999).","DOI":"10.1109\/18.782097"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Hoeffding W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963).","DOI":"10.1080\/01621459.1963.10500830"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"K\u00f6rner J., Simonyi G.: Separating partition systems and locally different sequences. SIAM J. Discret. Math. (SIDMA) 1(3), 355\u2013359 (1988).","DOI":"10.1137\/0401035"},{"key":"60_CR16","unstructured":"Pinsker M.S., Sagalovich Y.L.: Lower bound on the cardinality of code of automata\u2019s states. Probl. Inf. Transm. 8(3), 59\u201366 (1972)."},{"key":"60_CR17","unstructured":"Sagalovich Y.L.: Completely separating systems. Probl. Inf. Transm. 18(2), 140\u2013146 (1982)."},{"key":"60_CR18","unstructured":"Sagalovich Y.L.: Separating systems. Probl. Inf. Transm. 30(2), 105\u2013123 (1994)."},{"key":"60_CR19","doi-asserted-by":"crossref","unstructured":"Staddon J.N., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47(3), 1042\u20131049 (2001).","DOI":"10.1109\/18.915661"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"Stinson D.R., van Trung T., Wei R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Plan. Inference 86(2), 595\u2013617 (2000).","DOI":"10.1016\/S0378-3758(99)00131-7"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0060-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0060-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0060-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:39Z","timestamp":1559231919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0060-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,27]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0060-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,27]]}}}