{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:26:46Z","timestamp":1772602006422,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701129"],"award-info":[{"award-number":["11701129"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531002"],"award-info":[{"award-number":["11531002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1109\/lcomm.2020.3014617","type":"journal-article","created":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T20:29:48Z","timestamp":1596745788000},"page":"2674-2677","source":"Crossref","is-referenced-by-count":5,"title":["Minimal Linear Codes From Vectors With Given Weights"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1381-5471","authenticated-orcid":false,"given":"Yanfeng","family":"Qi","sequence":"first","affiliation":[]},{"given":"Ting","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Bing","family":"Dai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45239-0_6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2420118"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.03.029"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2819196"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45066-1_2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2018.08.010"},{"key":"ref16","article-title":"The parameters of minimal linear codes","author":"lu","year":"2019","journal-title":"arXiv 1911 07648"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2019018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00682-1"},{"key":"ref19","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-018-0367-x"},{"key":"ref4","article-title":"An inductive construction of minimal codes","author":"bartoli","year":"2019","journal-title":"arXiv 1911 09093"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860412"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891992"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847722"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2823704"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-019-00930-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0442-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12160-4_3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60114-7_7"},{"key":"ref9","article-title":"A novel application of Boolean functions with high algebraic immunity in minimal codes","author":"chen","year":"2020","journal-title":"arXiv 2004 04932"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.705584"},{"key":"ref20","first-page":"246","article-title":"Minimal codewords and secret sharing","author":"massey","year":"1993","journal-title":"Proc 6th Joint Swedish-Russian Workshop Inf Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0556-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-016-0186-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2956130"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2978387"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2918537"},{"key":"ref25","article-title":"Full characterization of minimal linear codes as cutting blocking sets","author":"tang","year":"2019","journal-title":"arXiv 1911 09867"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9289005\/09160990.pdf?arnumber=9160990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:47:51Z","timestamp":1651074471000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9160990\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":29,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2020.3014617","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"value":"1089-7798","type":"print"},{"value":"1558-2558","type":"electronic"},{"value":"2373-7891","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}