{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T13:18:08Z","timestamp":1774271888066,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Scientific Research Fund of Education Department of Yunnan Province","award":["2025J0581"],"award-info":[{"award-number":["2025J0581"]}]},{"name":"Yunnan Fundamental Research Projects","award":["202501AT070444"],"award-info":[{"award-number":["202501AT070444"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00236-026-00525-2","type":"journal-article","created":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:57:42Z","timestamp":1772254662000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Structure of finite maximal prefix codes with constant average length 4"],"prefix":"10.1007","volume":"63","author":[{"given":"Haiyan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongdong","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunyong","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,28]]},"reference":[{"key":"525_CR1","volume-title":"Codes and Automata","author":"J Berstel","year":"2010","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2010)"},{"key":"525_CR2","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.3390\/e26121000","volume":"26","author":"S Congero","year":"2024","unstructured":"Congero, S., Zeger, K.: A characterization of optimal prefix codes. Entropy 26, 1000 (2024)","journal-title":"Entropy"},{"key":"525_CR3","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell Syst. Tech. J. 38, 933\u2013967 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"525_CR4","doi-asserted-by":"publisher","first-page":"2855","DOI":"10.1109\/TIT.2023.3236688","volume":"69","author":"P Hor\u00e1k","year":"2024","unstructured":"Hor\u00e1k, P., Hromada, V., Gro\u0161ek, O.: On the maximum size of a prefix code. IEEE Trans. Inform. Theory 69, 2855\u20132859 (2024)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"525_CR5","first-page":"849","volume":"45","author":"Y Liu","year":"2021","unstructured":"Liu, Y.: Maximal prefix codes with constant average length. Southeast Asian Bull. Math. 45, 849\u2013871 (2021)","journal-title":"Southeast Asian Bull. Math."},{"key":"525_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00236-023-00449-1","volume":"61","author":"HY Liu","year":"2024","unstructured":"Liu, H.Y., Cui, R.D., Zhang, T.J.: $$n$$-PS-codes, 2-infix-outfix codes and some related classes of codes. Acta Inform. 61, 67\u201381 (2024)","journal-title":"Acta Inform."},{"key":"525_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0304-3975(00)00438-2","volume":"273","author":"A De Luca","year":"2002","unstructured":"De Luca, A.: Some combinatorial results on Bernoulli sets and codes. Theoret. Comput. Sci. 273, 143\u2013165 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"525_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/TIT.1956.1056809","volume":"2","author":"MP Sch\u00fctzenberger","year":"1956","unstructured":"Sch\u00fctzenberger, M.P.: On an application of semigroup methods to some problems in coding. IRE Trans. Inf. Theory 2, 47\u201360 (1956)","journal-title":"IRE Trans. Inf. Theory"},{"key":"525_CR9","first-page":"381","volume":"6","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On a family of submonoids. Publ. Math. Inst. Hungar. Acad. Sci. Ser. A 6, 381\u2013391 (1961)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci. Ser. A"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00525-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-026-00525-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00525-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:25:36Z","timestamp":1774268736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-026-00525-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,28]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["525"],"URL":"https:\/\/doi.org\/10.1007\/s00236-026-00525-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,28]]},"assertion":[{"value":"11 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2026","order":3,"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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"11"}}