{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:01:16Z","timestamp":1773615676745,"version":"3.50.1"},"reference-count":11,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.3103\/s014641162107021x","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T09:15:43Z","timestamp":1643706943000},"page":"795-808","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Properties of Algebraic Geometric Codes as Copy Protection Codes"],"prefix":"10.3103","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8258-2419","authenticated-orcid":false,"given":"V. M.","family":"Deundyak","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8990-9058","authenticated-orcid":false,"given":"D. V.","family":"Zagumennov","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"7406_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D.R. Stinson","year":"1998","unstructured":"Stinson, D.R. and Wei, R., Combinatorial properties and constructions of traceability schemes and frameproof codes, SIAM J. Discrete Math., 1998, vol. 11, no. 1, pp. 41\u201353. \u00a0https:\/\/doi.org\/10.1137\/S0895480196304246","journal-title":"SIAM J. Discrete Math."},{"key":"7406_CR2","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J.N. Staddon","year":"2001","unstructured":"Staddon, J.N., Stinson, D.R., and Wei, R., Combinatorial properties of frameproof and traceability codes, IEEE Trans. Inf. Theory, 2001, vol. 47, no. 3, pp. 1042\u20131049. \u00a0https:\/\/doi.org\/10.1109\/18.915661","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7406_CR3","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TIT.2003.810630","volume":"49","author":"A. Silverberg","year":"2003","unstructured":"Silverberg, A., Staddon, J., and Walker, J.L., Applications of list decoding to tracing traitors, IEEE Trans. Inf. Theory, 2003, vol. 49, no. 5, pp. 1312\u20131318. \u00a0https:\/\/doi.org\/10.1109\/TIT.2003.810630","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7406_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1134\/S0032946019030074","volume":"55","author":"G.A. Kabatyansky","year":"2019","unstructured":"Kabatyansky, G.A., Traceability codes and their generalizations, Probl. Inf. Transm., 2019, vol. 55, no. 3, pp.\u00a0283\u2013294. \u00a0https:\/\/doi.org\/10.1134\/S0032946019030074","journal-title":"Probl. Inf. Transm."},{"key":"7406_CR5","first-page":"21","volume":"18","author":"V.M. Deundyak","year":"2011","unstructured":"Deundyak, V.M. and Mkrtichyan, V.V., Research of applying bounds of the information protection scheme based on RS-codes, Diskretn. Anal. Issled. Oper., 2011, vol. 18, no. 3, pp.\u00a021\u201338.","journal-title":"Diskretn. Anal. Issled. Oper."},{"key":"7406_CR6","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1134\/S0032946015040092","volume":"51","author":"V.M. Deundyak","year":"2015","unstructured":"Deundyak, V.M., Yevpak, S.A., and Mkrtichyan, V.V., Analysis of properties of q-ary Reed\u2013Muller error-correcting codes viewed as codes for copyright protection, Probl. Inf. Transm., 2015, vol. 51, no. 4, pp. 398\u2013408. \u00a0https:\/\/doi.org\/10.1134\/S0032946015040092","journal-title":"Probl. Inf. Transm."},{"key":"7406_CR7","doi-asserted-by":"publisher","unstructured":"Zagumennov, D.V. and Mkrtichyan, V.V., On application of algebraic geometry codes of L-construction in copy protection, Prikl. Disretn. Mat., 2019, no. 44, pp. 67\u201393. \u00a0https:\/\/doi.org\/10.17223\/20710410\/44\/6","DOI":"10.17223\/20710410\/44\/6"},{"key":"7406_CR8","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977."},{"key":"7406_CR9","first-page":"38","volume":"16","author":"S.A. Yevpak","year":"2014","unstructured":"Yevpak, S.A. and Mrktichyan, V.V., Applicability conditions for q-ary Reed\u2013Muller codes in traitor tracing, Vladikavkaz. \n               Mat. Zh., 2014, vol. 16, no. 2, pp. 38\u201345.","journal-title":"Mat. Zh."},{"key":"7406_CR10","series-title":"Algebraic geometry codes","volume-title":"Handbook of Coding Theory","author":"T. H\u00f8holdt","year":"1998","unstructured":"H\u00f8holdt, T., van Lint, J.H., and Pellikaan, G.R., Algebraic geometry codes,   Handbook of Coding Theory, Pless, V.S. and Huffman, W.C., Eds., Elsevier, 1998, vol. 1, pp. 871\u2013961."},{"key":"7406_CR11","unstructured":"Vladuts, S.G., Nogin, D.Yu., and Tsfasman, M.A., Algebrogeometricheskie kody. Osnovnye ponyatiya (Algebrogeometric Codes: Main Concepts), Moscow: MCCME, 2003."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S014641162107021X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S014641162107021X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S014641162107021X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:03:11Z","timestamp":1773612191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S014641162107021X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":11,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["7406"],"URL":"https:\/\/doi.org\/10.3103\/s014641162107021x","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"19 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}