{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T14:47:50Z","timestamp":1760453270222,"version":"3.38.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s40314-025-03082-5","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T23:30:49Z","timestamp":1736811049000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Application of multi-secret sharing schemes using LCD codes over $$\\mathfrak {R}=\\mathcal {R}\\left[ w\\right] $$"],"prefix":"10.1007","volume":"44","author":[{"given":"Karima","family":"Chatouh","sequence":"first","affiliation":[]},{"given":"Dejia","family":"Mokhtari","sequence":"additional","affiliation":[]},{"given":"Kenza","family":"Guenda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"3082_CR1","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, \u00c7alkavur S, Shoaib H, Sol\u00e9 P (2020) A multisecret-sharing scheme based on LCD codes. Mathematics 8:272","journal-title":"Mathematics"},{"key":"3082_CR2","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10623-019-00713-x","volume":"88","author":"S Bhowmick","year":"2020","unstructured":"Bhowmick S, Fotue-Tabue A, Mart\u00ednez-Moro E, Bandi R, Bagchi S (2020) Do non-free LCD codes over finite commutative Frobenius rings exist? Des Codes Crypt 88:825\u2013840","journal-title":"Des Codes Crypt"},{"key":"3082_CR3","unstructured":"Bustomi A, Santika P, Suprijanto D (2019) Linear codes over the ring $$\\mathbb{Z}_{4}+ u\\mathbb{Z}_{4} + v\\mathbb{Z}_{4} + w\\mathbb{Z}_{4} + uv\\mathbb{Z}_{4} + uw\\mathbb{Z}_{4} + vw\\mathbb{Z}_{4} + uvw\\mathbb{Z}_{4}$$. arXiv:1904.11117v1 [cs.IT]"},{"key":"3082_CR4","first-page":"107","volume":"94","author":"S \u00c7alkavur","year":"2017","unstructured":"\u00c7alkavur S, Sol\u00e9 P (2017) Multisecret sharing schemes and bounded distance decoding of linear codes. Int J Comput 94:107\u2013114","journal-title":"Int J Comput"},{"key":"3082_CR5","first-page":"290","volume":"5","author":"S \u00c7alkavur","year":"2020","unstructured":"\u00c7alkavur S, Nauman SK, \u00d6zel C, Zekraoui H (2020) The least-squares solutions in linear codes based multisecret-sharing approach. Int J Inf Coding Theory 5:290\u2013302","journal-title":"Int J Inf Coding Theory"},{"issue":"1","key":"3082_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3934\/amc.2016.10.131","volume":"10","author":"C Carlet","year":"2016","unstructured":"Carlet C, Guilley S (2016) Complementary dual codes for counter-measures to side-channel attacks. Adv Math Commun 10(1):131\u2013150. https:\/\/doi.org\/10.3934\/amc.2016.10.131","journal-title":"Adv Math Commun"},{"key":"3082_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 TA, Noui L (2017) Simplex and MacDonald codes over $$R_{q}$$. J Appl Math Comput 55:455\u2013478","journal-title":"J Appl Math Comput"},{"key":"3082_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 TA (2020) 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. Comput Appl Math 39:1\u201339","journal-title":"Comput Appl Math"},{"key":"3082_CR9","first-page":"1023","volume":"3","author":"LC Ding","year":"1997","unstructured":"Ding LC, Renvail A (1997) Linear multisecret-sharing schemes and error correcting codes. J Comput Sci 3:1023\u20131036","journal-title":"J Comput Sci"},{"key":"3082_CR10","first-page":"61","volume":"11","author":"KM Faraoun","year":"2019","unstructured":"Faraoun KM (2019) A novel verifiable and unconditionally secure $$(m, t, n)$$-threshold multi-secret sharing scheme using overdetermined systems of linear equations over finite Galois fields. Int J Inf Comput Secur 11:61\u201382","journal-title":"Int J Inf Comput Secur"},{"key":"3082_CR11","doi-asserted-by":"publisher","unstructured":"Hossain MA, Bandi R (2021) LCD codes as a counter-measure for relevant security threats: a survey. In: 19th OITS international conference on information technology (OCIT), Bhubaneswar, India, p 302\u2013307. https:\/\/doi.org\/10.1109\/OCIT53463.2021.00067","DOI":"10.1109\/OCIT53463.2021.00067"},{"key":"3082_CR12","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1007\/s10623-019-00664-3","volume":"87","author":"Z Liu","year":"2019","unstructured":"Liu Z, Wang J (2019) Linear complementary dual codes over rings. Des Codes Crypt 87:3077\u20133086","journal-title":"Des Codes Crypt"},{"key":"3082_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.23939\/mmc2023.01.147","volume":"10","author":"M Malki","year":"2023","unstructured":"Malki M, Chatouh K (2023) Construction of linear codes over $$\\cal{R} =\\sum \\nolimits _{s=0}^{4}v_{5}^{s}\\cal{A} _{4}$$. Math Model Comput 10:147\u2013158","journal-title":"Math Model Comput"},{"key":"3082_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106","author":"JL Massey","year":"1992","unstructured":"Massey JL (1992) Linear codes with complementary duals. Discrete Math 106:337\u2013342","journal-title":"Discrete Math"},{"key":"3082_CR15","unstructured":"Ranya DB, Aicha B (2019) Skew constacyclic and LCD codes over $$\\mathbb{F}_{q}+v\\mathbb{F}_{q}$$. arXiv:1902.08557v1 [cs.IT]"},{"key":"3082_CR16","unstructured":"Shi M, Sol\u00e9 P (2015) Skew cyclic codes over $$\\mathbb{F} _{q}+ v\\mathbb{F}_{q}+\\ldots + v^{m-1}\\mathbb{F}_{q}$$. In: Proceedings international workshop on the arithmetic of finite fields"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03082-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03082-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03082-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T06:07:42Z","timestamp":1741932462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03082-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["3082"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03082-5","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"4 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2025","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"}}],"article-number":"123"}}