{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:29:55Z","timestamp":1753882195547,"version":"3.41.2"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:p> Secret-sharing is a vital topic of cryptography and has widely used in information protection. One technique to the development of secret-sharing schemes is primarily based on error-correcting codes. In this paper, we determine the minimal codewords of relative four-weight codes and have the utility in the secret sharing schemes. <\/jats:p>","DOI":"10.1142\/s1793830923500623","type":"journal-article","created":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T06:59:39Z","timestamp":1688108379000},"source":"Crossref","is-referenced-by-count":0,"title":["Minimal codewords: An application of relative four-weight codes"],"prefix":"10.1142","volume":"16","author":[{"given":"B.","family":"Rega","sequence":"first","affiliation":[{"name":"Department of Mathematics, Bharathidasan University, Tiruchirappalli, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Ramesh","family":"Babu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Amrita School of Physical Sciences, Coimbatore, Amrita Vishwa Vidyapeetham, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,7,20]]},"reference":[{"key":"S1793830923500623BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/18.705584"},{"key":"S1793830923500623BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847722"},{"key":"S1793830923500623BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/18.556621"},{"key":"S1793830923500623BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90190-6"},{"key":"S1793830923500623BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2473861"},{"key":"S1793830923500623BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/18.761275"},{"key":"S1793830923500623BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.07.029"},{"key":"S1793830923500623BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9896-2"},{"key":"S1793830923500623BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-015-0276-1"},{"first-page":"276","volume-title":"Proc. Joint Swedish-Russian Workshop on Information Theory","author":"Massey J. L.","key":"S1793830923500623BIB010"},{"key":"S1793830923500623BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-020-00456-w"},{"key":"S1793830923500623BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/18.476213"},{"key":"S1793830923500623BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860412"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923500623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T03:30:26Z","timestamp":1715139026000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923500623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,20]]},"references-count":13,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["10.1142\/S1793830923500623"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923500623","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2023,7,20]]},"article-number":"2350062"}}