{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T09:50:00Z","timestamp":1780566600572,"version":"3.54.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":["11171150"],"award-info":[{"award-number":["11171150"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012558","name":"Foundation of Science and Technology on Information Assurance Laboratory","doi-asserted-by":"publisher","award":["KJ-13-001"],"award-info":[{"award-number":["KJ-13-001"]}],"id":[{"id":"10.13039\/501100012558","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002630","name":"Brain Korea 21 Plus Mathematical Science Team for Global Women Leaders at Ewha Womans University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002630","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/tit.2019.2946840","type":"journal-article","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T20:12:29Z","timestamp":1570738349000},"page":"3657-3663","source":"Crossref","is-referenced-by-count":40,"title":["Optimal Few-Weight Codes From Simplicial Complexes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7234-9119","authenticated-orcid":false,"given":"Yansheng","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaomeng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2873-5549","authenticated-orcid":false,"given":"Qin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2015.12.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2993179"},{"key":"ref13","article-title":"Optimal minimal linear codes from posets","author":"hyun","year":"0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2014.01.009"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891562"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-017-0277-y"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.09.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2742499"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2614934"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2420118"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0442-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896886"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896872"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"},{"key":"ref7","author":"grassl","year":"0","journal-title":"Bounds on the minimum distance of linear codes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847722"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026421315292"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2455032"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.050"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-016-0206-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-017-0345-8"},{"key":"ref24","first-page":"175","article-title":"Optimal three-weight cubic codes","volume":"17","author":"shi","year":"2018","journal-title":"Comput Math Appl"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s40840-017-0553-1"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9098132\/08864088.pdf?arnumber=8864088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:32:56Z","timestamp":1651080776000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8864088\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":24,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2946840","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}