{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:24Z","timestamp":1772893044183,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T00:00:00Z","timestamp":1674950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T00:00:00Z","timestamp":1674950400000},"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":"publisher","award":["62001362"],"award-info":[{"award-number":["62001362"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2020M683427"],"award-info":[{"award-number":["2020M683427"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Fund from the Chongqing Key Lab of Computer Network and Communication Technology","award":["CY-CNCL-2021-01"],"award-info":[{"award-number":["CY-CNCL-2021-01"]}]},{"name":"Open Fund from the Chongqing Key Lab of Computer Network and Communication Technology","award":["61977051"],"award-info":[{"award-number":["61977051"]}]},{"name":"Open Fund from the Chongqing Key Lab of Computer Network and Communication Technology","award":["61971322"],"award-info":[{"award-number":["61971322"]}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","award":["XJS220310"],"award-info":[{"award-number":["XJS220310"]}],"id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10623-023-01190-z","type":"journal-article","created":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T11:03:00Z","timestamp":1674990180000},"page":"1923-1934","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Constructions of multi-permutation codes correcting a single burst of deletions"],"prefix":"10.1007","volume":"91","author":[{"given":"Hui","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8504-9705","authenticated-orcid":false,"given":"Jianjun","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaopeng","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Cheng","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanzhan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,29]]},"reference":[{"key":"1190_CR1","unstructured":"Balakirsky V.B., Vinck A.J.H.: On the performance of permutation codes for multi-user communication. In Proc. IEEE Int. Symp. Inf. Theory, IEEE, Lausanne, 5, 307 (2002)."},{"key":"1190_CR2","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/TIT.1972.1054729","volume":"18","author":"T Berger","year":"1972","unstructured":"Berger T., Jelinek F., Wolf J.K.: Permutation codes for sources. IEEE Trans. Inf. Theory 18, 160\u2013169 (1972).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1190_CR3","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/TIT.2019.2933819","volume":"66","author":"YM Chee","year":"2020","unstructured":"Chee Y.M., Ling S., Nguyen T.T., Vu V.K., Wei H., Zhang X.: Burst-deletion-correcting codes for permutations and multipermutations. IEEE Trans. Inf. Theory 66, 957\u2013969 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1190_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/B:DESI.0000029212.52214.71","volume":"32","author":"W Chu","year":"2004","unstructured":"Chu W., Colbourn C.J., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32, 51\u201364 (2004).","journal-title":"Des. Codes Cryptogr."},{"key":"1190_CR5","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\u00f8ve 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":"1190_CR6","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1109\/TIT.2013.2239700","volume":"59","author":"F Farnoud","year":"2013","unstructured":"Farnoud F., Skachek V., Milenkovic O.: Error-correction in flash memories via codes in the Ulam metric. IEEE Trans. Inf. Theory 59, 3003\u20133020 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1190_CR7","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1109\/TCOMM.2005.858683","volume":"53","author":"HC Ferreira","year":"2005","unstructured":"Ferreira H.C., Vinck A.J.H., Swart T.G., de Beer I.: Permutation trellis codes. IEEE Trans. Commun. 53, 1782\u20131789 (2005).","journal-title":"IEEE Trans. Commun."},{"key":"1190_CR8","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1109\/LCOMM.2018.2859962","volume":"22","author":"H Han","year":"2018","unstructured":"Han H., Mu J., Jiao X., He Y.-C.: Codes correcting a burst of deletions for permutations and multi-permutations. IEEE Commun. Lett. 22, 1968\u20131971 (2018).","journal-title":"IEEE Commun. Lett."},{"key":"1190_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/LCOMM.2020.3021749","volume":"25","author":"H Han","year":"2021","unstructured":"Han H., Mu J., He Y.-C., Jiao X., Ma W.: Rate-improved permutation codes for correcting a single burst of deletions. IEEE Commun. Lett. 25, 49\u201353 (2021).","journal-title":"IEEE Commun. Lett."},{"key":"1190_CR10","doi-asserted-by":"publisher","first-page":"2659","DOI":"10.1109\/TIT.2009.2018336","volume":"55","author":"A Jiang","year":"2009","unstructured":"Jiang A., Mateescu R., Schwartz M., Bruck J.: Rank modulation for flash memories. IEEE Trans. Inf. Theory 55, 2659\u20132673 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1190_CR11","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein V.I.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Doklady 10, 707\u2013710 (1966).","journal-title":"Soviet Phys. Doklady"},{"key":"1190_CR12","first-page":"298","volume":"19","author":"VI Levenshtein","year":"1970","unstructured":"Levenshtein V.I.: Asymptotically optimum binary codes with correction for losses of one or two adjacent bits. Syst. Theory Res. 19, 298\u2013304 (1970).","journal-title":"Syst. Theory Res."},{"key":"1190_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/dma.1992.2.3.241","volume":"2","author":"VI Levenshtein","year":"1992","unstructured":"Levenshtein V.I.: On perfect codes in deletion and insertion metric. Discret. Math. Appl. 2, 241\u2013258 (1992).","journal-title":"Discret. Math. Appl."},{"key":"1190_CR14","doi-asserted-by":"publisher","first-page":"4535","DOI":"10.1109\/TCOMM.2019.2902149","volume":"67","author":"L Peng","year":"2019","unstructured":"Peng L.: The generation of $$(n, n(n-1), n-1)$$ permutation group codes for communication systems. IEEE Trans. Commun. 67, 4535\u20134549 (2019).","journal-title":"IEEE Trans. Commun."},{"key":"1190_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1109\/PROC.1965.3680","volume":"53","author":"D Slepian","year":"1965","unstructured":"Slepian D.: Permutation modulation. Proc. IEEE 53, 228\u2013236 (1965).","journal-title":"Proc. IEEE"},{"key":"1190_CR16","first-page":"45","volume":"54","author":"AJH Vinck","year":"2000","unstructured":"Vinck A.J.H.: Coded modulation for power line communications. AEU J. 54, 45\u201349 (2000).","journal-title":"AEU J."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01190-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01190-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01190-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:08:22Z","timestamp":1682021302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01190-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,29]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1190"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01190-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,29]]},"assertion":[{"value":"28 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}