{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:31Z","timestamp":1740122551593,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T00:00:00Z","timestamp":1459987200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301098"],"award-info":[{"award-number":["11301098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2013GXNSFCA019001"],"award-info":[{"award-number":["2013GXNSFCA019001"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2014GXNSFDA118001"],"award-info":[{"award-number":["2014GXNSFDA118001"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["100-2115-M-009-005-MY3"],"award-info":[{"award-number":["100-2115-M-009-005-MY3"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation of Guangxi Education Department","award":["2013YB039"],"award-info":[{"award-number":["2013YB039"]}]},{"name":"Guangxi \u201cBagui Scholar\u201d Teams for Innovation and Research"},{"name":"JSPS Grant-in-Aid for Scientific Researc","award":["15K04974"],"award-info":[{"award-number":["15K04974"]}]},{"name":"Guangxi Higher Institutions\u2019 Program of Introducing 100 High-Level Overseas Talents"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10623-016-0203-x","type":"journal-article","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T12:20:10Z","timestamp":1460031610000},"page":"71-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Codes with the identifiable parent property for multimedia fingerprinting"],"prefix":"10.1007","volume":"83","author":[{"given":"Minquan","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Hung-Lin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Yuan-Hsun","family":"Lo","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Miao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,7]]},"reference":[{"key":"203_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, 852\u2013865 (2003).","DOI":"10.1109\/TIT.2003.809570"},{"key":"203_CR2","doi-asserted-by":"crossref","unstructured":"Barg A., Cohen G., Encheva S., Kabatiansky G., Z\u00e9mor G.: A hypergraph approach to the identifying parent property: the case of multiple parents. SIAM J. Discret. Math. 14, 423\u2013431 (2001).","DOI":"10.1137\/S0895480100376848"},{"key":"203_CR3","doi-asserted-by":"crossref","unstructured":"Barg A., Kabatiansky G.: A class of I.P.P. codes with efficient identification. J. Complex. 20, 137\u2013147 (2004).","DOI":"10.1016\/j.jco.2003.08.012"},{"key":"203_CR4","doi-asserted-by":"crossref","unstructured":"Blackburn S.R.: An upper bound on the size of a code with the $$k$$ k -identifiable property. J. Comb. Theory Ser. A 102, 179\u2013185 (2003).","DOI":"10.1016\/S0097-3165(03)00030-X"},{"key":"203_CR5","doi-asserted-by":"crossref","unstructured":"Blackburn S.R.: Combinatorial schemes for protecting digital content. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 307, pp. 43\u201373. Cambridge University Press, Cambridge (2003).","DOI":"10.1017\/CBO9781107359970.004"},{"key":"203_CR6","unstructured":"Cheng M., Fu H.-L., Jiang J., Lo Y.-H., Miao Y.: Codes with the identifiable parent property for multimedia fingerprinting. arXiv:1411.6784"},{"key":"203_CR7","doi-asserted-by":"crossref","unstructured":"Cheng M., Ji L., Miao Y.: Separable codes. IEEE Trans. Inf. Theory 58, 1791\u20131803 (2012).","DOI":"10.1109\/TIT.2011.2174614"},{"key":"203_CR8","doi-asserted-by":"crossref","unstructured":"Cheng M., Miao Y.: On anti-collusion codes and detection algorithms for multimedia fingerprinting. IEEE Trans. Inf. Theory 57, 4843\u20134851 (2011).","DOI":"10.1109\/TIT.2011.2146130"},{"key":"203_CR9","doi-asserted-by":"crossref","unstructured":"Chor B., Fiat A., Naor M.: Tracing traitors. In: Advances in Cryptology-CRYPTO\u201994. Lecture Notes in Computer Science, vol. 839, pp. 257\u2013270. Springer, Berlin (1994).","DOI":"10.1007\/3-540-48658-5_25"},{"key":"203_CR10","doi-asserted-by":"crossref","unstructured":"Etzion T., Trachtenberg A., Vardy A.: Which codes have cycle-free Tanner graphs. IEEE Trans. Inf. Theory 45, 2173\u20132181 (1999).","DOI":"10.1109\/18.782170"},{"key":"203_CR11","unstructured":"Forney G.D.: Concatenated Codes. MIT Press, Cambridge, MA (1966)."},{"key":"203_CR12","doi-asserted-by":"crossref","unstructured":"Gao F., Ge G.: New bounds on separable codes. IEEE Trans. Inf. Theory 60, 5257\u20135262 (2014).","DOI":"10.1109\/TIT.2014.2331989"},{"key":"203_CR13","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-V\u00e1zquez P., Balbuena C., Marcote X., Valenzuela J.C.: On extremal bipartite graphs with high girth. In: Electronic Notes Discrete Mathematics, vol. 26, pp. 67\u201373 (2006).","DOI":"10.1016\/j.endm.2006.08.012"},{"key":"203_CR14","doi-asserted-by":"crossref","unstructured":"Hollmann H.D.L., van Lint J.H., Linnartz J.-P., Tolhuizen L.M.G.M.: On codes with the identifiable parent property. J. Comb. Theory Ser. A 82, 121\u2013133 (1998).","DOI":"10.1006\/jcta.1997.2851"},{"key":"203_CR15","doi-asserted-by":"crossref","unstructured":"Kautz W.H., Singleton R.R.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10, 363\u2013377 (1964).","DOI":"10.1109\/TIT.1964.1053689"},{"key":"203_CR16","doi-asserted-by":"crossref","unstructured":"Lam T.: Graphs without cycles of even length. Bull. Aust. Math. Soc. 63, 435\u2013440 (2001).","DOI":"10.1017\/S0004972700019511"},{"key":"203_CR17","unstructured":"Lam T.: A result on $$2k$$ 2 k -cycle-free bipartite graphs. Australas. J. Comb. 32, 163\u2013170 (2005)."},{"key":"203_CR18","doi-asserted-by":"crossref","unstructured":"Liu K.J.R., Trappe W., Wang Z.J., Wu M., Zhao H.: Multimedia Fingerprinting Forensics for Traitor Tracing. Hindawi, New York (2005).","DOI":"10.1155\/9789775945181"},{"key":"203_CR19","unstructured":"Neuwirth S.: The size of bipartite graphs with girth eight. arXiv:math\/0102210 (2008)."},{"key":"203_CR20","unstructured":"Payne S.E.: Generalized quadrangles. In: Handbook of Combinatorial Designs, 2nd edn, pp. 472\u2013477. Chapman & Hall\/CRC, Boca Raton (2007)."},{"key":"203_CR21","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, 1042\u20131049 (2001).","DOI":"10.1109\/18.915661"},{"key":"203_CR22","doi-asserted-by":"crossref","unstructured":"Tanner M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 533\u2013547 (1981).","DOI":"10.1109\/TIT.1981.1056404"},{"key":"203_CR23","doi-asserted-by":"crossref","unstructured":"Trappe W., Wu M., Wang Z.J., Liu K.J.R.: Anti-collusion fingerprinting for multimedia. IEEE Trans. Signal Process 51, 1069\u20131087 (2003).","DOI":"10.1109\/TSP.2003.809378"},{"key":"203_CR24","doi-asserted-by":"crossref","unstructured":"van Trung T., Martirosyan S.: New constructions for IPP codes. Des. Codes Cryptogr. 35, 227\u2013239 (2005).","DOI":"10.1007\/s10623-005-6402-5"},{"key":"203_CR25","doi-asserted-by":"crossref","unstructured":"Wu M., Trappe W., Wang Z.J., Liu K.J.R.: Collusion-resistant fingerprinting for multimedia. IEEE Signal Process. Mag. 21, 15\u201327 (2004).","DOI":"10.1109\/MSP.2004.1276103"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0203-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0203-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0203-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0203-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:42Z","timestamp":1559231922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0203-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0203-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,4,7]]}}}