{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:33:07Z","timestamp":1780054387736,"version":"3.54.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":["62032009"],"award-info":[{"award-number":["62032009"]}],"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":[[2024,12]]},"DOI":"10.1109\/tit.2024.3449899","type":"journal-article","created":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T17:25:51Z","timestamp":1724693151000},"page":"8713-8722","source":"Crossref","is-referenced-by-count":1,"title":["A New Upper Bound for Linear Codes and Vanishing Partial Weight Distributions"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4558-8982","authenticated-orcid":false,"given":"Hao","family":"Chen","sequence":"first","affiliation":[{"name":"College of Information Science and Technology\/Cyber Security, Jinan University, Guangzhou, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0249-9519","authenticated-orcid":false,"given":"Conghui","family":"Xie","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology\/Cyber Security, Jinan University, Guangzhou, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977319"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.705584"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80115-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054939"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00124590"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90870-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/18.2.97"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2922630"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3208438"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3346179"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3348146"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(73)80007-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.11.009"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2420118"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2473861"},{"issue":"1","key":"ref17","first-page":"12","article-title":"Minimum possible block length of a linear code for some distances","volume":"20","author":"Dodunekov","year":"1984","journal-title":"Problems Inf. Transmiss."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01222850"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/ffta.2000.0299"},{"key":"ref20","volume-title":"Bounds Minimum Distance Linear Codes Quantum Codes","author":"Grassl","year":"2024"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3287853"},{"key":"ref23","article-title":"The classification of all (145, 7, 72) binary linear codes","volume":"80","author":"Helleseth","year":"1980"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056405"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056658"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2550029"},{"key":"ref27","first-page":"75","article-title":"Optimal linear codes","volume-title":"Cryptography and Coding II","author":"Hill","year":"1992"},{"key":"ref28","first-page":"147","article-title":"Codes correcteurs d\u2019erreurs","volume":"2","author":"Hocquenghem","year":"1959","journal-title":"Chiffres"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3163651"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3305609"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2993179"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057107"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0167-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-022-01021-7"},{"key":"ref36","article-title":"The main conjecture for near-MDS codes","volume-title":"Proc. 9th Int. Workshop Coding Cryptogr. (WCC)","author":"Landjev"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2016.12.004"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58575-3"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3347701"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/s0924-6509(08)x7030-8"},{"key":"ref41","volume-title":"Webpage Known Griesmer Almost Griesmer Codes","author":"Maruta","year":"2024"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3205967"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/19M1260876"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3295836"},{"key":"ref45","volume-title":"Cyclic Error-Correcting Codes Two Symbols","author":"Prange","year":"1957"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/18.868496"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0488-z"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3001591"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90080-X"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1997.2864"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2913389"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10767121\/10648774.pdf?arnumber=10648774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:32:09Z","timestamp":1732667529000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10648774\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":51,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3449899","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}