{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T03:19:57Z","timestamp":1769483997098,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["12301430"],"award-info":[{"award-number":["12301430"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["12171452"],"award-info":[{"award-number":["12171452"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10623-025-01741-6","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T12:39:49Z","timestamp":1767616789000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved bounds for codes over trees"],"prefix":"10.1007","volume":"94","author":[{"given":"Yanzhi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingting","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiande","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"1741_CR1","unstructured":"Knuth, D.\u00a0E., et\u00a0al..: The Art Of Computer Programming, Volume 1, 3\/E. Pearson Education India, (1997)."},{"key":"1741_CR2","doi-asserted-by":"crossref","unstructured":"Breiman, L.: Classification and regression trees. Routledge, (2017).","DOI":"10.1201\/9781315139470"},{"key":"1741_CR3","unstructured":"Cormen, T.\u00a0H., Leiserson, C.\u00a0E., Rivest, R.\u00a0L., Stein, C.: Introduction to algorithms. MIT press, (2022)."},{"key":"1741_CR4","unstructured":"Jurafsky, D., Martin, J.\u00a0H.: Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Pearson Prentice Hall, (2009)."},{"issue":"5","key":"1741_CR5","doi-asserted-by":"publisher","first-page":"8114","DOI":"10.1109\/JIOT.2019.2922538","volume":"6","author":"M Wu","year":"2019","unstructured":"Wu M., Wang K., Cai X., Guo S., Guo M., Rong C.: A comprehensive survey of blockchain: from theory to iot applications and beyond. IEEE Internet Things J. 6(5), 8114\u20138154 (2019).","journal-title":"IEEE Internet Things J."},{"issue":"6","key":"1741_CR6","doi-asserted-by":"publisher","first-page":"3599","DOI":"10.1109\/TIT.2021.3057939","volume":"67","author":"L Yohananov","year":"2021","unstructured":"Yohananov L., Yaakobi E.: Codes over trees. IEEE Trans. Inf. Theory 67(6), 3599\u20133622 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1741_CR7","unstructured":"Wikipedia, \u201cC++ standard library,\u201d 2023. [Online]. Available: https:\/\/en.wikipedia.org\/wiki\/C"},{"key":"1741_CR8","unstructured":"Microsoft, \u201cMicrosoft\u2019s c++ standard library,\u201d 2024. [Online]. Available: https:\/\/github.com\/microsoft\/STL"},{"key":"1741_CR9","unstructured":"Josuttis, N.\u00a0M.: \u201cThe c++ standard library: a tutorial and reference,\u201d (2012)."},{"key":"1741_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil P., Cheng E., Gawlick D., O\u2019Neil E.: The log-structured merge-tree (lsm-tree). Acta Informatica 33, 351\u2013385 (1996).","journal-title":"Acta Informatica"},{"key":"1741_CR11","unstructured":"Agrawal, N.: \u201cDesign tradeoffs for ssd performance,\u201d in USENIX ATC, (2008)."},{"key":"1741_CR12","unstructured":"Min, C., Kim, K., Cho, H., Lee, S.-W., Eom, Y.\u00a0I.: \u201cSfs: random write considered harmful in solid state drives.\u201d in FAST, vol.\u00a012, 2012, pp. 1\u201316."},{"key":"1741_CR13","unstructured":"Hopcroft, J.\u00a0E., Ullman, J.\u00a0D., Aho, A.\u00a0V.: Data structures and algorithms. Addison-wesley Boston, MA, USA:, (1983), vol. 175."},{"key":"1741_CR14","unstructured":"Ford, D., Labelle, F., Popovici, F.\u00a0I., Stokely, M., Truong, V.-A., Barroso, L., Grimes, C., Quinlan, S.: \u201cAvailability in globally distributed storage systems,\u201d in 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI 10), (2010)."},{"key":"1741_CR15","unstructured":"Rashmi, K.\u00a0V., Shah, N.\u00a0B., Gu, D., Kuang, H., Borthakur, D., Ramchandran, K.: \u201cA solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the facebook warehouse cluster,\u201d in 5th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage 13), (2013)."},{"key":"1741_CR16","first-page":"376","volume":"23","author":"A Cayley","year":"1889","unstructured":"Cayley A.: A theorem on trees. Quart. J. Math. 23, 376\u2013378 (1889).","journal-title":"Quart. J. Math."},{"issue":"3","key":"1741_CR17","doi-asserted-by":"publisher","first-page":"823","DOI":"10.7151\/dmgt.2153","volume":"40","author":"H-C Lee","year":"2020","unstructured":"Lee H.-C., Chen Z.-C.: Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars. Discu Math Graph Theory 40(3), 823\u2013839 (2020).","journal-title":"Discu Math Graph Theory"},{"key":"1741_CR18","unstructured":"Neuwirth, S.: \u201cThe size of bipartite graphs with girth eight,\u201d arXiv preprint math\/0102210, (2001)."},{"key":"1741_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02020254","volume":"9","author":"I Reiman","year":"1958","unstructured":"Reiman I.: \u00dcber ein problem von k. Zarankiewicz. Acta Mathe Academiae Scientiarum Hungarica 9, 269\u2013273 (1958).","journal-title":"Acta Mathe Academiae Scientiarum Hungarica"},{"key":"1741_CR20","unstructured":"Moon, J.\u00a0W.: Counting labelled trees. Canadian Mathematical Congress, (1970), vol. 112."},{"issue":"2","key":"1741_CR21","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0097-3165(90)90064-4","volume":"53","author":"L Tak\u00e1cs","year":"1990","unstructured":"Tak\u00e1cs L.: On Cayley\u2019s formula for counting forests. J. Combinat. Theory, Series A 53(2), 321\u2013323 (1990).","journal-title":"J. Combinat. Theory, Series A"},{"key":"1741_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy J.A., Murty U.S.R.: Graph theory. Springer Publishing Company, Incorporated (2008)."},{"issue":"1\/6","key":"1741_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2307\/1967217","volume":"11","author":"LE Dickson","year":"1896","unstructured":"Dickson L.E.: The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group. Annals Math. 11(1\/6), 65\u2013120 (1896).","journal-title":"Annals Math."},{"issue":"1","key":"1741_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/jcta.1996.0067","volume":"75","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi Z.: New asymptotics for bipartite Tur\u00e1n numbers. J. Combinat. Theory, Series A 75(1), 141\u2013144 (1996).","journal-title":"J. Combinat. Theory, Series A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01741-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01741-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01741-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T17:13:15Z","timestamp":1769447595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01741-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["1741"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01741-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"9 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 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 have no Conflict of interest to declare that are relevant to the content of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"21"}}