{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T06:07:57Z","timestamp":1681020477619},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T00:00:00Z","timestamp":1551484800000},"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":[[2019,10]]},"DOI":"10.1007\/s10623-019-00624-x","type":"journal-article","created":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T07:06:04Z","timestamp":1551510364000},"page":"2361-2374","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Steganographic schemes from perfect codes on Cayley graphs"],"prefix":"10.1007","volume":"87","author":[{"given":"Jon-Lark","family":"Kim","sequence":"first","affiliation":[]},{"given":"Junyong","family":"Park","sequence":"additional","affiliation":[]},{"given":"Soohak","family":"Choi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,2]]},"reference":[{"key":"624_CR1","unstructured":"Crandall R.: Some notes on steganography (1998)."},{"key":"624_CR2","first-page":"65","volume":"12","author":"P Dorbec","year":"2005","unstructured":"Dorbec P., Mollard M.: Perfect codes in Cartesian products of 2-paths and infinite paths. J. Comb. 12, 65 (2005).","journal-title":"J. Comb."},{"key":"624_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615825","volume-title":"Elementary Number Theory, Group Theory, and Ramanujan Graphs","author":"G Davidoff","year":"2003","unstructured":"Davidoff G., Sarnak P., Valette A.: Elementary Number Theory, Group Theory, and Ramanujan Graphs. Cambridge University Press, Cambridge (2003)."},{"key":"624_CR4","volume-title":"Steganography in Digital Media","author":"J Fridrich","year":"2010","unstructured":"Fridrich J.: Steganography in Digital Media. Cambridge University Press, New York (2010)."},{"key":"624_CR5","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1109\/TIT.2007.892768","volume":"53","author":"J Fridrich","year":"2007","unstructured":"Fridrich J., Linson\u0115k P.: Grid Colorings Steganogr. IEEE Trans. Inf. Thoery 53, 1547\u20131549 (2007).","journal-title":"IEEE Trans. Inf. Thoery"},{"key":"624_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/0118025","volume":"18","author":"SW Golomb","year":"1970","unstructured":"Golomb S.W., Welch L.R.: Perfect codes in the Lee metric and the packing of polyominoes. SIAM J. Appl. Math. 18, 302\u2013317 (1970).","journal-title":"SIAM J. Appl. Math."},{"key":"624_CR7","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1016\/j.dam.2011.07.022","volume":"159","author":"J-L Kim","year":"2011","unstructured":"Kim J.-L., Kim S.-J.: The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes. Discret. Appl. Math. 159, 2222\u20132228 (2011).","journal-title":"Discret. Appl. Math."},{"key":"624_CR8","doi-asserted-by":"crossref","unstructured":"Krotov D.S.: On calculation of the interweight distribution of an equitable partition. \n                    arXiv:1303.0002v2\n                    \n                   [math.CO] 1 Jul (2013).","DOI":"10.1007\/s10801-013-0492-3"},{"key":"624_CR9","doi-asserted-by":"publisher","first-page":"3042","DOI":"10.1109\/TIT.2007.903126","volume":"53","author":"C Mart\u00ednez","year":"2007","unstructured":"Mart\u00ednez C., Beivide R., Gabidulin E.M.: Perfect codes for metrics induced by circulant graphs. IEEE Trans. Inf. Thoery 53, 3042\u20133052 (2007).","journal-title":"IEEE Trans. Inf. Thoery"},{"key":"624_CR10","doi-asserted-by":"publisher","first-page":"3552","DOI":"10.1109\/TIT.2009.2023733","volume":"55","author":"C Mart\u00ednez","year":"2009","unstructured":"Mart\u00ednez C., Beivide R., Gabidulin E.M.: Perfect codes from Cayley graphs over Lipschitz integers. IEEE Trans. Inf. Thoery 55, 3552\u20133562 (2009).","journal-title":"IEEE Trans. Inf. Thoery"},{"key":"624_CR11","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.ejc.2010.11.007","volume":"32","author":"M Mollard","year":"2011","unstructured":"Mollard M.: On perfect codes in Cartesian product of graphs. Eur. J. Comb. 32, 398\u2013403 (2011).","journal-title":"Eur. J. Comb."},{"key":"624_CR12","unstructured":"Munuera C.: Steganography from a coding theory point of view. In: Algebraic Geometry Modelling in Information Theory. Edited by Martinez-Moro E., World Scientific, pp. 83\u2013128, (2012)."},{"key":"624_CR13","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nfeld D, Winkler A.: Embedding with syndrome coding based on BCH codes. In: Proceedings of the 8th Workshop on Multimedia and Security. ACM (2006).","DOI":"10.1145\/1161366.1161405"},{"key":"624_CR14","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1137\/040621387","volume":"21","author":"S Spacapan","year":"2007","unstructured":"Spacapan S.: Optimal Lee-type local structures in Cartesian products of cycles and paths. SIAM J. Discret. Math. 21, 750\u2013762 (2007).","journal-title":"SIAM J. Discret. Math."},{"key":"624_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0124010","volume":"24","author":"A Tiet\u00e4v\u00e4inen","year":"1973","unstructured":"Tiet\u00e4v\u00e4inen A.: On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24, 88\u201396 (1973).","journal-title":"SIAM J. Appl. Math."},{"key":"624_CR16","unstructured":"Van Dijk M., Willems F.: Embedding information in grayscale images. In: Proceedings of the 22nd Symposium on Information and Communication Theory in the Benelux. Enschede, The Netherlands (2001)."},{"issue":"1","key":"624_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10623-007-9135-9","volume":"46","author":"W Zhang","year":"2008","unstructured":"Zhang W., Li S.: A coding problem in steganography. Des. Codes Cryptogr. 46(1), 67\u201381 (2008).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00624-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00624-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00624-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:14:51Z","timestamp":1583021691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00624-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,2]]},"references-count":17,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["624"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00624-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,2]]},"assertion":[{"value":"23 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}