{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T10:48:04Z","timestamp":1756810084290,"version":"3.37.3"},"reference-count":23,"publisher":"Informa UK Limited","issue":"11","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11426148,61373150"],"award-info":[{"award-number":["11426148,61373150"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Technologies R&D Program of Shaanxi Province","award":["2013k0611"],"award-info":[{"award-number":["2013k0611"]}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1080\/00207160.2015.1075986","type":"journal-article","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T05:25:29Z","timestamp":1437974729000},"page":"1818-1832","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["Ideal access structures based on a class of minimal linear codes"],"prefix":"10.1080","volume":"93","author":[{"given":"Zhihui","family":"Li","sequence":"first","affiliation":[]},{"given":"Yun","family":"Song","sequence":"additional","affiliation":[]},{"given":"Yongming","family":"Li","sequence":"additional","affiliation":[]}],"member":"301","published-online":{"date-parts":[[2015,9,2]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2014.941360"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1109\/18.705584"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104445654"},{"issue":"6","key":"CIT0005","first-page":"105","volume":"434","author":"Brickell E.F.","year":"1989","journal-title":"Combin. Math. Combin. Comput."},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2011.07.024"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-012-0076-4"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880058"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011511"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.11.009"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"C.S. Ding and Y. Jin,Covering and secret sharing with linear codes, Discrete Mathematics and Theoretical Computer Science: Lecture Notes in Computer Science, Springer Verlag, 2003, pp. 11\u201325.","DOI":"10.1007\/3-540-45066-1_2"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2007.03.003"},{"key":"CIT0013","first-page":"127","author":"Gurak S.","year":"2004","journal-title":"Number Theory"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.3792\/pjaa.82.87"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.11.032"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.07.029"},{"volume-title":"Cryptography and Coding IV","year":"1995","author":"Massey J.L.","key":"CIT0019"},{"issue":"3","key":"CIT0020","doi-asserted-by":"crossref","first-page":"251","DOI":"10.4064\/aa-39-3-251-264","volume":"39","author":"Myerson G.","year":"1981","journal-title":"Acta Arith."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9323-x"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2011.07.002"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1002\/sec.972"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.01.008"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9038-9"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2015.1075986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T15:30:25Z","timestamp":1567006225000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2015.1075986"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,2]]},"references-count":23,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2015,9,4]]},"published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.1080\/00207160.2015.1075986"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2015.1075986","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"type":"print","value":"0020-7160"},{"type":"electronic","value":"1029-0265"}],"subject":[],"published":{"date-parts":[[2015,9,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}