{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:31Z","timestamp":1740131671477,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["11301503"],"award-info":[{"award-number":["11301503"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/tit.2017.2689026","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T03:48:18Z","timestamp":1490932098000},"page":"909-917","source":"Crossref","is-referenced-by-count":8,"title":["Linear Size Constant-Composition Codes Meeting the Johnson Bound"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7823-8068","authenticated-orcid":false,"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4234-3610","authenticated-orcid":false,"given":"Xiande","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"153","article-title":"Disjoint difference families with block size 3","volume":"52","author":"dinitz","year":"1997","journal-title":"Utilitas Math"},{"key":"ref38","article-title":"Note 16","author":"skolem","year":"1927","journal-title":"E Netto Kombinatorik"},{"journal-title":"Infinite families of 2-designs and 3-designs from linear codes","year":"2016","author":"ding","key":"ref33"},{"article-title":"Ternary codes with weight constraints","year":"1999","author":"svanstr\u00f6m","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828150"},{"key":"ref37","first-page":"550","article-title":"Packing","author":"stinson","year":"2007","journal-title":"CRC Handbook of Combinatorial Designs"},{"key":"ref36","first-page":"392","article-title":"Difference families","author":"abel","year":"2007","journal-title":"CRC Handbook of Combinatorial Designs"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.37236\/1162","article-title":"A new table of constant weight codes of length greater than 28","volume":"13","author":"smith","year":"2006","journal-title":"Electron J Combin"},{"key":"ref34","first-page":"1229","article-title":"Codes and designs","volume":"2","author":"tonchev","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901175"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/B:PRIT.0000011273.98799.a8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006420"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9312-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926349"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9214-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2137370"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/s11425-008-0036-9","article-title":"A new combinatorial approach to the construction of constant composition codes","volume":"51","author":"jianxing","year":"2008","journal-title":"Sci China Ser A Math"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926380"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201692"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911167"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.09.009"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"33","DOI":"10.37236\/1726","article-title":"Bounds for DNA codes with constant GC-content","volume":"10","author":"king","year":"2003","journal-title":"Electron J Combinat"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.971741"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819339"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/B:DESI.0000029212.52214.71"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855612"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844087"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855609"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034814"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-0004-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.887875"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.10.015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284676"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875070"},{"key":"ref24","first-page":"357","article-title":"Random constant composition codes for multiple access channels","volume":"13","author":"dyachkov","year":"1984","journal-title":"Problems Control Inf Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282998"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.370114"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371026"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8263292\/07889025.pdf?arnumber=7889025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:24:27Z","timestamp":1642004667000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7889025\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":39,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2689026","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}