{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T07:03:08Z","timestamp":1780038188338,"version":"3.53.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12271390"],"award-info":[{"award-number":["12271390"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["A2025205023"],"award-info":[{"award-number":["A2025205023"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funded by Science Research Project of Hebei Education Department","award":["JCZX2026032"],"award-info":[{"award-number":["JCZX2026032"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10623-026-01838-6","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:51:36Z","timestamp":1778853096000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructions of quintuple constant-composition codes with weight four and distance three"],"prefix":"10.1007","volume":"94","author":[{"given":"Lijun","family":"Ji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zihong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaohuan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,15]]},"reference":[{"key":"1838_CR1","doi-asserted-by":"crossref","unstructured":"Bennett F.E.: Concerning pairwise balanced designs with prime power block sizes. In: Kramer E.S., Magliveras S.S. (eds.) Finite Geometries and Combinatorial Designs, p. 237. American Mathematical Society, Providence (1990)","DOI":"10.1090\/conm\/111\/1079735"},{"key":"1838_CR2","first-page":"35","volume":"39","author":"GT Bogdanova","year":"2003","unstructured":"Bogdanova G.T., Kapralov S.N.: Enumeration of optimal ternary codes with a given composition. Problemy Peredachi Informatsii 39, 35\u201340 (2003).","journal-title":"Problemy Peredachi Informatsii"},{"key":"1838_CR3","doi-asserted-by":"publisher","first-page":"3552","DOI":"10.1109\/TIT.2008.926349","volume":"54","author":"YM Chee","year":"2008","unstructured":"Chee Y.M., Ge G., Ling A.C.H.: Group divisible codes and their application in the construction of optimal constant-composition codes of weight three. IEEE Trans. Inf. Theory 54, 3552\u20133564 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1838_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/TIT.2007.911167","volume":"54","author":"YM Chee","year":"2008","unstructured":"Chee Y.M., Ling S.: Improved lower bounds for constant GC-content DNA codes. IEEE Trans. Inf. Theory 54, 391\u2013394 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1838_CR5","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.dam.2005.09.009","volume":"154","author":"W Chu","year":"2006","unstructured":"Chu W., Colbourn C.J., Duke P.: On constant composition codes. Discret. Appl. Math. 154, 912\u2013929 (2006).","journal-title":"Discret. Appl. Math."},{"key":"1838_CR6","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn C.J., Kl\u00f6e T., Ling A.C.H.: Permutation arrays for powerline communication and mutually orthogonal Latin squares. IEEE Trans. Inf. Theory 50, 1289\u20131291 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1838_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0378-3758(78)90008-3","volume":"2","author":"M Deza","year":"1978","unstructured":"Deza M., Vanstone S.A.: Bound for permutation arrays. J. Stat. Plan. Inference 2, 197\u2013209 (1978).","journal-title":"J. Stat. Plan. Inference"},{"key":"1838_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0378-3758(78)90008-3","volume":"2","author":"M Deza","year":"1978","unstructured":"Deza M., Vanstone S.A.: Bound for permutation arrays. J. Stat. Plan. Inference 2, 197\u2013209 (1978).","journal-title":"J. Stat. Plan. Inference"},{"key":"1838_CR9","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1109\/TIT.2005.855612","volume":"51","author":"C Ding","year":"2005","unstructured":"Ding C., Yin J.: Combinatorial constructions of optimal constant-composition codes. IEEE Trans. Inf. Theory 51, 3671\u20133674 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1838_CR10","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1109\/TIT.2005.844087","volume":"51","author":"C Ding","year":"2005","unstructured":"Ding C., Yin J.: Algebraic constructions of constant-composition codes. IEEE Trans. Inf. Theory 51, 1585\u20131589 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1838_CR11","doi-asserted-by":"publisher","first-page":"3742","DOI":"10.1109\/TIT.2011.2137370","volume":"57","author":"F Gao","year":"2011","unstructured":"Gao F., Ge G.: Optimal ternary constant composition codes of weight four and distance five. IEEE Trans. Inf. Theory 57, 3742\u20133757 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1838_CR12","first-page":"205","volume-title":"Contemporary Design Theory","author":"A Hartman","year":"1992","unstructured":"Hartman A., Phelps K.T.: Steiner quadruple systems. In: Dinitz J.H., Stinson D.R. (eds.) Contemporary Design Theory, pp. 205\u2013240. Wiley, New York (1992)."},{"key":"1838_CR13","first-page":"181","volume":"37","author":"A Hartman","year":"1990","unstructured":"Hartman A., Phelps K.T.: Tetrahedral quadruples systems. Utilitas Math. 37, 181\u2013189 (1990).","journal-title":"Utilitas Math."},{"key":"1838_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/jcd.21640","volume":"27","author":"L Ji","year":"2019","unstructured":"Ji L.: A complete solution to existence of $$H$$ designs. J. Combin. Des. 27, 75\u201381 (2019).","journal-title":"J. Combin. Des."},{"key":"1838_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10623-008-9198-2","volume":"48","author":"L Ji","year":"2008","unstructured":"Ji L.: 2-idempotent 3-quasigroups with a conjugate invariant subgroup consisting of a single cycle of length four. Des. Codes Cryptogr. 48, 59\u201368 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"1838_CR16","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1007\/s11425-006-2013-5","volume":"49","author":"L Ji","year":"2006","unstructured":"Ji L.: Purely tetrahedral quadruple systems. Sci. China Ser. A 49, 1327\u20131340 (2006).","journal-title":"Sci. China Ser. A"},{"key":"1838_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0378-3758(96)00064-X","volume":"58","author":"DL Kreher","year":"1997","unstructured":"Kreher D.L., Stinson D.R.: Small group-divisible designs with block size four. J. Stat. Plan. Inference 58, 111\u2013118 (1997).","journal-title":"J. Stat. Plan. Inference"},{"key":"1838_CR18","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.disc.2018.12.021","volume":"342","author":"M Liang","year":"2019","unstructured":"Liang M., Ji L.: Optimal ternary constant-composition codes with weight four and distance three. Discret. Math. 342, 1079\u20131088 (2019).","journal-title":"Discret. Math."},{"key":"1838_CR19","doi-asserted-by":"crossref","unstructured":"Milenkovic O., Kashyap N.: On the Design of Codes for DNA. Lecture Notes in Computer Science, vol. 3969, pp. 100\u2013119. Springer, Berlin (2006).","DOI":"10.1007\/11779360_9"},{"key":"1838_CR20","first-page":"33","volume":"45","author":"RC Mullin","year":"1997","unstructured":"Mullin R.C., Ling A.C.H., Abel R.J.R., Bennett F.E.: On the closure of subsets of $$\\{4, 5, \\ldots, 9\\}$$ which contain $$4$$. Ars Combin. 45, 33\u201376 (1997).","journal-title":"Ars Combin."},{"key":"1838_CR21","doi-asserted-by":"publisher","first-page":"2644","DOI":"10.1109\/18.887875","volume":"46","author":"M Svanstr\u00f6m","year":"2000","unstructured":"Svanstr\u00f6m M.: Constructions of ternary constant-composition codes with weight three. IEEE Trans. Inf. Theory 46, 2644\u20132647 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1838_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/18.971741","volume":"48","author":"M Svanstr\u00f6m","year":"2002","unstructured":"Svanstr\u00f6m M., \u00d6sterg\u00e5rd P.R.J., Bogdanova G.T.: Bounds and constructions for ternary constant-composition codes. IEEE Trans. Inf. Theory 48, 101\u2013111 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1838_CR23","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-1-4615-6654-0_27","volume-title":"Coding Theory and Design Theory Part II","author":"L Teirlinck","year":"1990","unstructured":"Teirlinck L.: Generalized idempotent orthogonal arrays. In: Ray-Chaudhuri D. (ed.) Coding Theory and Design Theory Part II, pp. 368\u2013378. Springer, New York (1990)."},{"key":"1838_CR24","first-page":"561","volume-title":"Contemporary Design Theory","author":"L Teirlinck","year":"1992","unstructured":"Teirlinck L.: Large sets of disjoint designs and related structures. In: Dinitz J.H., Stinson D.R. (eds.) Contemporary Design Theory, pp. 561\u2013592. Wiley, New York (1992)."},{"key":"1838_CR25","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.disc.2014.10.015","volume":"338","author":"H Wei","year":"2015","unstructured":"Wei H., Zhang H., Zhu M., Ge G.: Optimal ternary constant-composition codes with weight four and distance six. Discret. Math. 338, 72\u201387 (2015).","journal-title":"Discret. Math."},{"key":"1838_CR26","doi-asserted-by":"publisher","first-page":"6012","DOI":"10.1109\/TIT.2012.2201692","volume":"58","author":"M Zhu","year":"2012","unstructured":"Zhu M., Ge G.: Quaternary constant-composition codes with weight $$4$$ and distances $$5$$ or $$6$$. IEEE Trans. Inf. Theory 58, 6012\u20136021 (2012).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01838-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01838-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01838-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T06:19:54Z","timestamp":1780035594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01838-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["1838"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01838-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"4 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"108"}}