{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:08:53Z","timestamp":1742404133731},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s40314-020-01181-z","type":"journal-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T17:02:45Z","timestamp":1590512565000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New classes of codes over $$R_{q,p,m}={\\mathbb {Z}}_{p^{m}}[u_{1}, u_{2}, \\ldots , u_{ q}]\/\\left\\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\\right\\rangle $$ and their applications"],"prefix":"10.1007","volume":"39","author":[{"given":"Karima","family":"Chatouh","sequence":"first","affiliation":[]},{"given":"Kenza","family":"Guenda","sequence":"additional","affiliation":[]},{"given":"T. Aaron","family":"Gulliver","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"1181_CR1","unstructured":"Ashikhmin A, Barg A (1994) Minimal vectors in linear codes and sharing of secrets. In: van Tilborg HCA, Willems FMJ (eds) Proceedings of the EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, The Netherlands, p. 41"},{"key":"1181_CR2","doi-asserted-by":"crossref","unstructured":"Beimel A (2011) Secret-sharing schemes: a survey, in coding and cryptology, vol 6639. Lecture Notes in Computer Science. Springer, Berlin, pp 11\u201346","DOI":"10.1007\/978-3-642-20901-7_2"},{"issue":"1","key":"1181_CR3","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 TA, Noui L (2017) 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","journal-title":"J Appl Math Comput"},{"issue":"1\u20132","key":"1181_CR4","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(1\u20132):455\u2013478","journal-title":"J Appl Math Comput"},{"issue":"7","key":"1181_CR5","first-page":"2777","volume":"9","author":"J Chen","year":"2013","unstructured":"Chen J, Huang Y, Fu B, Li J (2013) Secret sharing schemes from a class of linear codes over finite chain ring. J Comput Inform Syst 9(7):2777\u20132784","journal-title":"J Comput Inform Syst"},{"key":"1181_CR6","doi-asserted-by":"crossref","unstructured":"Cohen G, Mesnager S, Patey A (2013) On minimal and quasi minimal linear codes, Proceedings of the International Conference on Cryptography and Coding, vol 8308. Lecture Notes in Computer Science. Springer, Berlin, pp 85\u201398","DOI":"10.1007\/978-3-642-45239-0_6"},{"key":"1181_CR7","first-page":"51","volume":"73","author":"C Ding","year":"2006","unstructured":"Ding C, Salomaa A (2006) Secret sharing schemes with nice access structures. Fund Inform 73:51\u201363","journal-title":"Fund Inform"},{"issue":"9","key":"1181_CR8","first-page":"1023","volume":"3","author":"C Ding","year":"1997","unstructured":"Ding C, Laihonen T, Renvall A (1997) Linear multisecret-sharing schemes and error-correcting codes. J Univ Comput Sci 3(9):1023\u20131036","journal-title":"J Univ Comput Sci"},{"key":"1181_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0304-3975(00)00207-3","volume":"246","author":"C Ding","year":"2000","unstructured":"Ding C, Kohelb DR, Ling S (2000) Secret-sharing with a class of ternary codes. Theor Comput Sci 246:285\u2013298","journal-title":"Theor Comput Sci"},{"key":"1181_CR10","doi-asserted-by":"crossref","unstructured":"Ding C, Yuan J (2003) Covering and secret sharing with linear codes, in Discrete Mathematics and Theoretical Computer Science, vol 2731. Lecture Notes in Computer Science. Springer, Berlin, pp 11\u201325","DOI":"10.1007\/3-540-45066-1_2"},{"issue":"1","key":"1181_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"ED Karnin","year":"1983","unstructured":"Karnin ED, Greene JW, Hellman ME (1983) On secret sharing systems. IEEE Trans Inf Theory 29(1):35\u201341","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"1181_CR12","first-page":"87","volume":"57","author":"JC Ku-Cauich","year":"2009","unstructured":"Ku-Cauich JC, Tapia-Recillas H (2009) Secret sharing schemes based on almost-bent functions. Int J Pure Appl Math 57(1):87\u2013102","journal-title":"Int J Pure Appl Math"},{"issue":"5","key":"1181_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11859-013-0949-1","volume":"18","author":"Z Li","year":"2013","unstructured":"Li Z, Sun J, Li J (2013) A novel secret sharing scheme based on minimal linear codes. Wuhan Univ J Nat Sci 18(5):407\u2013412","journal-title":"Wuhan Univ J Nat Sci"},{"key":"1181_CR14","unstructured":"Massey JL (1993) Minimal codewords and secret sharing, in Proc. Joint Swedish-Russian Int. Workshop on Info. Theory, M\u00f6lle, Sweden, pp 276\u2013279"},{"key":"1181_CR15","unstructured":"Massey JL (1995) Some applications of coding theory in cryptography. In: Farrell PG (ed) Codes and ciphers: cryptography and coding IV. Formara, Essex, England, pp. 33\u201347"},{"key":"1181_CR16","doi-asserted-by":"crossref","unstructured":"\u00d6demi\u015f Z\u00d6, Y\u0131ld\u0131z B, Dougherty ST (2016) On codes over $${\\mathbb{Z}}_{p^{s}}$$ with the extended Lee weight, Filomat, vol. 30, no. 2, pp. 255\u2013268","DOI":"10.2298\/FIL1602255O"},{"issue":"1","key":"1181_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10623-009-9309-8","volume":"54","author":"B Yildiz","year":"2010","unstructured":"Yildiz B, Karadeniz S (2010) Linear codes over $${\\mathbb{F}}_{2}+u{\\mathbb{F}}_{2}+v{\\mathbb{F}}_{2}+uv{\\mathbb{F}}_{2}$$. Designs Codes Crypt 54(1):61\u201381","journal-title":"Designs Codes Crypt"},{"key":"1181_CR18","unstructured":"Yildiz B, Kelebek IG (16 Apr 2015) The homogeneous weight for $$R_k$$, related Gray map and new binary quasicyclic codes, arXiv:1504.04111v1 [cs.IT]"},{"issue":"1","key":"1181_CR19","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TIT.2005.860412","volume":"52","author":"J Yuan","year":"2006","unstructured":"Yuan J, Ding C (2006) Secret sharing schemes from three slasses of linear codes. IEEE Trans Inf Theory 52(1):206\u2013212","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01181-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01181-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01181-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T23:16:25Z","timestamp":1621984585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01181-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,26]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1181"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01181-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,26]]},"assertion":[{"value":"30 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"152"}}