{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T12:40:17Z","timestamp":1695991217160},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T00:00:00Z","timestamp":1687219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T00:00:00Z","timestamp":1687219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10623-023-01253-1","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T09:02:20Z","timestamp":1687251740000},"page":"3321-3330","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two properties of prefix codes and uniquely decodable codes"],"prefix":"10.1007","volume":"91","author":[{"given":"Jie","family":"Xu","sequence":"first","affiliation":[]},{"given":"Zhiyong","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Kun","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Man","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"issue":"3","key":"1253_CR1","doi-asserted-by":"publisher","first-page":"454","DOI":"10.2307\/2343598","volume":"127","author":"IJ Good","year":"1964","unstructured":"Good I.J., Abramson N.: Information theory and coding. J. R. Stat. Soc. Ser. A (General) 127(3), 454 (1964).","journal-title":"J. R. Stat. Soc. Ser. A (General)"},{"issue":"4","key":"1253_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/TIT.1956.1056818","volume":"2","author":"B McMillan","year":"1956","unstructured":"McMillan B.: Two inequalities implied by unique decipherability. IRE Trans. Inf. Theory 2(4), 115\u2013116 (1956).","journal-title":"IRE Trans. Inf. Theory"},{"issue":"1","key":"1253_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4236\/am.2014.51011","volume":"5","author":"O Parkash","year":"2014","unstructured":"Parkash O., Kakkar P.: Optimum probability distribution for minimum redundancy of source coding. Appl. Math. 5(1), 96\u2013105 (2014).","journal-title":"Appl. Math."},{"issue":"10","key":"1253_CR4","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1049\/iet-com.2015.0819","volume":"10","author":"P Singh","year":"2016","unstructured":"Singh P., Amini A., Marvasti F., et al.: Set of uniquely decodable codes for overloaded synchronous CDMA. IET Commun. 10(10), 1236\u20131245 (2016).","journal-title":"IET Commun."},{"issue":"2","key":"1253_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.disc.2016.08.013","volume":"340","author":"A Woryna","year":"2017","unstructured":"Woryna A.: On the set of uniquely decodable codes with a given sequence of code word lengths. Discret. Math. 340(2), 51\u201357 (2017).","journal-title":"Discret. Math."},{"key":"1253_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.dam.2018.02.026","volume":"244","author":"A Woryna","year":"2018","unstructured":"Woryna A.: On the ratio of prefix codes to all uniquely decodable codes with a given length distribution. Discret. Appl. Math. 244, 205\u2013213 (2018).","journal-title":"Discret. Appl. Math."},{"key":"1253_CR7","volume-title":"Information Theory and Network Coding","author":"RW Yeung","year":"2008","unstructured":"Yeung R.W.: Information Theory and Network Coding. Springer, New York (2008)."},{"key":"1253_CR8","doi-asserted-by":"crossref","unstructured":"Yin, H., Ng, K.H., Yu, T.S., et al.: Decision procedure for the existence of two-channel prefix-free codes. In: 2019 IEEE International Symposium on Information Theory (ISIT). IEEE (2019).","DOI":"10.1109\/ISIT.2019.8849758"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01253-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01253-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01253-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T18:05:59Z","timestamp":1695924359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01253-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,20]]},"references-count":8,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1253"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01253-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,20]]},"assertion":[{"value":"3 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}