{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:01:57Z","timestamp":1755993717701,"version":"3.44.0"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"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":["11771419","12171452"],"award-info":[{"award-number":["11771419","12171452"]}],"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":[[2021,11]]},"DOI":"10.1109\/tit.2021.3105688","type":"journal-article","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T16:22:33Z","timestamp":1629303753000},"page":"7221-7231","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Ternary Codes With Weight <i>w<\/i> and Distance 2<i>w<\/i> - 2 in \u2113<sub>1<\/sub>-Metric"],"prefix":"10.1109","volume":"67","author":[{"given":"Xin","family":"Wei","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2878-3652","authenticated-orcid":false,"given":"Tingting","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Cyber Security, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4234-3610","authenticated-orcid":false,"given":"Xiande","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6610(1998)6:6<451::AID-JCD6>3.0.CO;2-E"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3052191"},{"key":"ref31","first-page":"87","article-title":"A construction method for multilevel error-correcting codes based on absolute summation weight","author":"jinushi","year":"1990","journal-title":"Proc Abst IEEE Int Symp Inform Theory"},{"key":"ref30","first-page":"100","article-title":"On the design of codes for DNA computing","author":"milenkovic","year":"2005","journal-title":"Proc Int Workshop Coding Cryptogr"},{"key":"ref34","first-page":"436","article-title":"Difference triangle sets","author":"shearer","year":"2006","journal-title":"Handbook of Combinatorial Designs"},{"key":"ref10","first-page":"1","article-title":"Bounds and constructions for multi-symbol duplication error correcting codes","author":"lenz","year":"2018","journal-title":"Proc 16th Int Workshop Algebr Combinat Coding Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3006228"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940256"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2789292"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058966"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9893-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056141"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.59932"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.887851"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2179412"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1109\/JPROC.2007.895188","article-title":"Channel coding: The road to channel capacity","volume":"95","author":"forney","year":"2007","journal-title":"Proc IEEE"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2365499"},{"key":"ref27","first-page":"5","article-title":"New bounds for the maximum size of ternary constant weight codes","volume":"26","author":"bogdanova","year":"2000","journal-title":"Serdica Math J"},{"key":"ref3","first-page":"1061","article-title":"On $l_{1}$\n-distance error control codes","author":"tallini","year":"2011","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref6","first-page":"152","article-title":"On codes correcting constant number of errors in $l_{1}$\n metric","author":"kabatiansky","year":"2015","journal-title":"Proc Collection Works 39-Te Dis-Tsiplinarno Cleavage Conf IPI RAS eInformation Technol Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.37236\/1726"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2239700"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","article-title":"Initial sequencing and analysis of the human genome","volume":"409","author":"lander","year":"2001","journal-title":"Nature"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2009.5069515"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868666"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048455"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2377735"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689026"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9919-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/17M1136171"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2690450"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043870"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9111-4"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9579483\/09515944.pdf?arnumber=9515944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:53:03Z","timestamp":1755910383000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9515944\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":34,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3105688","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,11]]}}}