{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:37:13Z","timestamp":1757313433761,"version":"3.28.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s12190-023-01941-0","type":"journal-article","created":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T14:02:32Z","timestamp":1701871352000},"page":"4833-4853","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["DNA multi-secret sharing schemes based on linear codes over $${\\mathbb {Z}}_{4} \\times R$$"],"prefix":"10.1007","volume":"69","author":[{"given":"Ahlem","family":"Melakhessou","sequence":"first","affiliation":[]},{"given":"Karima","family":"Chatouh","sequence":"additional","affiliation":[]},{"given":"Kenza","family":"Guenda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,6]]},"reference":[{"key":"1941_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021\u20131024 (1994)","journal-title":"Science"},{"issue":"2","key":"1941_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.3390\/math8020272","volume":"8","author":"A Alahmadi","year":"2020","unstructured":"Alahmadi, A., Altassan, A., AlKenani, A., Calkavur, S., Hatoon, S., Patrick, S.: A multi-secret sharing scheme based on LCD codes. Mathematics 8(2), 272 (2020)","journal-title":"Mathematics"},{"key":"1941_CR3","doi-asserted-by":"publisher","first-page":"101622","DOI":"10.1016\/j.ffa.2019.101622","volume":"62","author":"N Benbelkacem","year":"2020","unstructured":"Benbelkacem, N., Borges, J., Dougherty, S.T., Fern\u00e1ndez-C\u00f3rdoba, C.: On $${\\mathbb{Z} }_{2}{\\mathbb{Z} }_{4}$$-additive complementary dual codes and related LCD codes. Fin. Field. Appl. 62, 101622 (2020)","journal-title":"Fin. Field. Appl."},{"issue":"3","key":"1941_CR4","doi-asserted-by":"crossref","first-page":"871","DOI":"10.2298\/FIL2103871C","volume":"35","author":"B \u00c7aliskan","year":"2021","unstructured":"\u00c7aliskan, B.: On One-Weight and ACD Codes in $${\\mathbb{Z} }_{2}^{r}\\times {\\mathbb{Z} }_{4}^{s}\\times {\\mathbb{Z} }_{8}^{t}$$. Filomat 35(3), 871\u2013882 (2021)","journal-title":"Filomat"},{"key":"1941_CR5","first-page":"107","volume":"94","author":"S \u00c7alkavur","year":"2017","unstructured":"\u00c7alkavur, S., Sol\u00e9, P.: Multisecret sharing schemes and bounded distance decoding of linear codes. Int. J. Comput. 94, 107\u2013114 (2017)","journal-title":"Int. J. Comput."},{"issue":"1","key":"1941_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12190-015-0964-9","volume":"53","author":"K Chatouh","year":"2017","unstructured":"Chatouh, K., Guenda, K., Gulliver, T.A., Noui, L.: On some classes of linear codes over $${\\mathbb{Z} }_{2}{\\mathbb{Z} }_{4}$$ and their covering radii. J. Appl. Math. Comput. 53(1), 201\u2013222 (2017)","journal-title":"J. Appl. Math. Comput."},{"issue":"1\u20132","key":"1941_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s12190-016-1045-4","volume":"55","author":"K Chatouh","year":"2017","unstructured":"Chatouh, K., Guenda, K., Gulliver, T.A., Noui, L.: Simplex and MacDonald codes over $$R_{q}$$. J. Appl. Math. Comput. 55(1\u20132), 455\u2013478 (2017)","journal-title":"J. Appl. Math. Comput."},{"issue":"3","key":"1941_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-020-01181-z","volume":"39","author":"K Chatouh","year":"2020","unstructured":"Chatouh, K., Guenda, K., Gulliver, T.A.: New classes of codes over $$R_{q, p, m}={\\mathbb{Z} }_{p^{m}}[u_{1}, u_{2}, \\cdots , u_{ q}]\/\\left\\langle u_{i}^{2}=0, u_{i}u_{j}=u_{j}u_{i}\\right\\rangle $$ and their applications. Compu. Appl. Math. 39(3), 1\u201339 (2020)","journal-title":"Compu. Appl. Math."},{"issue":"1","key":"1941_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.18642\/jantaa_7100121710","volume":"16","author":"K Chatouh","year":"2016","unstructured":"Chatouh, K., Noui, L., Bin Mamat, M.: Codes over $${\\mathbb{Z} }_2({\\mathbb{Z} }_2 + u{\\mathbb{Z} }_2)$$ and their covering radii. J. Algebra Number Theory: Adv. Appl. 16(1), 25\u201339 (2016)","journal-title":"J. Algebra Number Theory: Adv. Appl."},{"unstructured":"Dixita L., Krishna G. B., Bansari R., Manish K. G.: On DNA codes using the ring $${\\mathbb{Z}}_4 + w{\\mathbb{Z}}_{4}$$, arXiv:1711.07324v2 [cs.IT] 9 Jan 2018","key":"1941_CR10"},{"issue":"3","key":"1941_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.13069\/jacodesmath.1000959","volume":"8","author":"K Gowdhaman","year":"2021","unstructured":"Gowdhaman, K., Gupta, S., Mohan, C., Guenda, K.: Cyclic DNA Codes over the ring $${\\mathbb{Z} }_{4}( {\\mathbb{Z} }_{4}+u {\\mathbb{Z} }_{4})$$. J. Algebra Comb. Discrete Appl. 8(3), 219\u2013231 (2021)","journal-title":"J. Algebra Comb. Discrete Appl."},{"issue":"24","key":"1941_CR12","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s00200-013-0188-x","volume":"6","author":"K Guenda","year":"2013","unstructured":"Guenda, K., Gulliver, T.A.: Construction of cyclic codes over $$ {\\mathbb{F} }_{2} + u {\\mathbb{F} }_{2} $$ for DNA computing. Appl. Algeb. Eng. Commun. Comput. 6(24), 445\u2013459 (2013)","journal-title":"Appl. Algeb. Eng. Commun. Comput."},{"unstructured":"Limbachiya, D., Benerjee, K. G., Rao, B., Gupta, M. K.: On DNA codes using the ring $$ {\\mathbb{Z}}_{4}+ w {\\mathbb{Z}}_{4}$$","key":"1941_CR13"},{"key":"1941_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2015.01.004","volume":"34","author":"X Liu","year":"2015","unstructured":"Liu, X., Liu, H.: LCD codes over finite chain rings. Fin. Fields Appl. 34, 1\u201319 (2015)","journal-title":"Fin. Fields Appl."},{"issue":"1","key":"1941_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.13069\/jacodesmath.671815","volume":"7","author":"A Melakhessou","year":"2019","unstructured":"Melakhessou, A., Aydin, N., Hebbache, Z., Guenda, K.: $${\\mathbb{Z} }_{q}( {\\mathbb{Z} }_{q}+u {\\mathbb{Z} }_{q})-$$ linear skew constacyclic codes. J. Algebra Comb. Discrete Appl. 7(1), 85\u2013101 (2019)","journal-title":"J. Algebra Comb. Discrete Appl."},{"key":"1941_CR16","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1109\/18.841186","volume":"46","author":"GH Norton","year":"2000","unstructured":"Norton, G.H., S\u0103l\u0103gean, A.: On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory. 46, 1060\u20131067 (2000)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"1941_CR17","first-page":"483","volume":"151","author":"CC Yang","year":"2004","unstructured":"Yang, C.C., Chang, T.Y., Hwang, M.S.: A New $$(t, n)$$-multisecret-sharing scheme. Appl. Math. Comput. 151, 483\u2013490 (2004)","journal-title":"Appl. Math. Comput."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01941-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01941-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01941-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T08:47:34Z","timestamp":1730796454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01941-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1941"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01941-0","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,12]]},"assertion":[{"value":"31 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that there is no conflict of interest in this research.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}