{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T04:12:23Z","timestamp":1748059943180,"version":"3.41.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["62032009","12471493","12441105"],"award-info":[{"award-number":["62032009","12471493","12441105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tit.2025.3557315","type":"journal-article","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T21:36:31Z","timestamp":1743629791000},"page":"4250-4259","source":"Crossref","is-referenced-by-count":0,"title":["Optimal, Almost Optimal Few-Weight Linear Codes and Related Quantum Codes"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0249-9519","authenticated-orcid":false,"given":"Conghui","family":"Xie","sequence":"first","affiliation":[{"name":"College of Information Science and Technology\/Cyber Security, Jinan University, Guangzhou, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4558-8982","authenticated-orcid":false,"given":"Hao","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology\/Cyber Security, Jinan University, Guangzhou, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1518-1313","authenticated-orcid":false,"given":"Haiyan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Institute of Mathematics, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0286-9263","authenticated-orcid":false,"given":"Yang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics, Hefei University of Technology, Hefei, Anhui, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8576-0823","authenticated-orcid":false,"given":"Huimin","family":"Lao","sequence":"additional","affiliation":[{"name":"Department of Industrial Systems Engineering and Management, National University of Singapore, Queenstown, Singapore"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.761270"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632163"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054939"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.850690"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057073"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.681315"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9191-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1142\/11101"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2017.08.014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2023035"},{"volume-title":"Bounds Minimum Distance Linear Codes Quantum Codes","year":"2024","author":"Grassl","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90404-H"},{"key":"ref14","first-page":"925","article-title":"A characterization of some q-ary codes (q > (h\u20131)2, h \u2265 3) meeting the Griesmer bound","volume-title":"Math. Japonica","volume":"38","author":"Hamada"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056405"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(81)90184-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056658"},{"key":"ref18","first-page":"265","article-title":"Projective codes meeting the Griesmer bound","volume-title":"Discrete Math.","volume":"106","author":"Helleseth"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2550029"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3006846"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3151721"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3203380"},{"key":"ref23","first-page":"75","article-title":"Optimal linear codes","volume-title":"Cryptography and Coding II","author":"Hill","year":"1992"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3163651"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3305609"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2993179"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00793-0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3406798"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3087082"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-022-01040-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0167-2"},{"volume-title":"Griesmer Bound for Linear Codes Over Finite Fields","year":"2024","author":"Maruta","key":"ref33"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3374420"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2025.106027"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90080-X"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.104317"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2707406"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946840"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2982381"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3142300"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3328932"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0441-6"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11011509\/10947539.pdf?arnumber=10947539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T17:04:10Z","timestamp":1748019850000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10947539\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":43,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3557315","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}