{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:56:26Z","timestamp":1772927786716,"version":"3.50.1"},"reference-count":23,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025eal2041","type":"journal-article","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T22:07:43Z","timestamp":1756850863000},"page":"753-756","source":"Crossref","is-referenced-by-count":0,"title":["Constructions of Multi-Permutation Codes Correcting at Most &lt;i&gt;t&lt;\/i&gt; Bursts of Stable Deletions"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Peng","family":"ZHAO","sequence":"first","affiliation":[{"name":"School of Computer and Information Technology, Xinyang Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"MU","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"HAN","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] A. Jiang, R. Mateescu, M. Schwartz, and J. Bruck, \u201cRank modulation for flash memories,\u201d IEEE Trans. Inf. Theory, vol.55, no.6, pp.2659-2673, June 2009. 10.1109\/tit.2009.2018336","DOI":"10.1109\/TIT.2009.2018336"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] A. Jiang, M. Schwartz, and J. Bruck, \u201cCorrecting charge-constrained errors in the rank-modulation scheme,\u201d IEEE Trans. Inf. Theory, vol.56, no.5, pp.2112-2120, May 2010. 10.1109\/tit.2010.2043764","DOI":"10.1109\/TIT.2010.2043764"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] F. Farnoud, V. Skachek, and O. Milenkovic, \u201cError-correction in flash memories via codes in the Ulam metric,\u201d IEEE Trans. Inf. Theory, vol.59, no.5, pp.3003-3020, May 2013. 10.1109\/tit.2013.2239700","DOI":"10.1109\/TIT.2013.2239700"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] E.E. Gad, A. Jiang, and J. Bruck, \u201cTrade-offs between instantaneous and total capacity in multi-cell flash memories,\u201d 2012 IEEE International Symposium on Information Theory Proceedings, pp.990-994, 2012. 10.1109\/isit.2012.6284712","DOI":"10.1109\/ISIT.2012.6284712"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] E.E. Gad, E. Yaakobi, A. Jiang, and J. Bruck, \u201cRank-modulation rewriting codes for flash memories,\u201d 2013 IEEE International Symposium on Information Theory, pp.704-708, 2013. 10.1109\/isit.2013.6620317","DOI":"10.1109\/ISIT.2013.6620317"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] J. Lee, S. Hur, and J. Choi, \u201cEffects of floating-gate interference on NAND flash memory cell operation,\u201d IEEE Electron Device Lett., vol.23, no.5, pp.264-266, 2002. 10.1109\/55.998871","DOI":"10.1109\/55.998871"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] V.I. Levenshtein, \u201cOn perfect codes in deletion and insertion metric,\u201d Discrete Math. Appl., vol.2, no.3, pp.241-258, Oct. 1992. 10.1515\/dma.1992.2.3.241","DOI":"10.1515\/dma.1992.2.3.241"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] R. Gabrys, E. Yaakobi, F. Farnoud, F. Sala, J. Bruck, and L. Dolecek, \u201cCodes correcting erasures and deletions for rank modulation,\u201d IEEE Trans. Inf. Theory, vol.62, no.1, pp.136-150, Jan. 2016. 10.1109\/TIT.2015.2493147","DOI":"10.1109\/TIT.2015.2493147"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] F. Sala, R. Gabrys, and L. Dolecek, \u201cDeletions in multipermutations,\u201d 2014 IEEE International Symposium on Information Theory, pp.2769-2773, 2014. 10.1109\/isit.2014.6875338","DOI":"10.1109\/ISIT.2014.6875338"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Y.M. Chee, S. Ling, T.T. Nguyen, V.K. Vu, and H. Wei, \u201cPermutation codes correcting a single burst deletion II: Stable deletions,\u201d 2017 IEEE International Symposium on Information Theory, pp.2688-2692, June 2017. 10.1109\/isit.2017.8007017","DOI":"10.1109\/ISIT.2017.8007017"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Y.M. Chee, V.K. Vu, and X. Zhang, \u201cPermutation codes correcting a single burst deletion I: Unstable deletions,\u201d 2015 IEEE International Symposium on Information Theory, pp.1741-1745, June 2015. 10.1109\/isit.2015.7282754","DOI":"10.1109\/ISIT.2015.7282754"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Y.M. Chee, S. Ling, T.T. Nguyen, V.K. Vu, H. Wei, and X. Zhang, \u201cBurst-deletion-correcting codes for permutations and multipermutations,\u201d IEEE Trans. Inf. Theory, vol.66, no.2, pp.957-969, Feb. 2020. 10.1109\/tit.2019.2933819","DOI":"10.1109\/TIT.2019.2933819"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Y. Sun, Y. Zhang, and G. Ge, \u201cImproved constructions of permutation and multi-permutation codes correcting a burst of stable deletions,\u201d IEEE Trans. Inf. Theory, vol.69, no.7, pp.4429-4441, July 2023. 10.1109\/tit.2023.3257174","DOI":"10.1109\/TIT.2023.3257174"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] H. Han, J. Mu, X. Jiao, and Y.-C. He, \u201cCodes correcting a burst of deletions for permutations and multi-permutations,\u201d IEEE Commun. Lett., vol.22, no.10, pp.1968-1971, Oct. 2018. 10.1109\/lcomm.2018.2859962","DOI":"10.1109\/LCOMM.2018.2859962"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] P. Zhao, J. Mu, Y. He, and X. Jiao, \u201cMultipermutation codes correcting a burst of deletions,\u201d IEICE Trans. Fundamentals, vol.E101-A, no.2, pp.535-538, Feb. 2018. 10.1587\/transfun.e101.a.535","DOI":"10.1587\/transfun.E101.A.535"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] H. Han, J. Mu, Y.-C. He, X. Jiao, and W. Ma, \u201cMulti-permutation codes correcting a single burst unstable deletions in flash memory,\u201d IEEE Commun. Lett., vol.24, no.4, pp.720-724, April 2020. 10.1109\/lcomm.2020.2966619","DOI":"10.1109\/LCOMM.2020.2966619"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] H. Han, J. Mu, Y.-C. He, X. Jiao, and W. Ma, \u201cRate-improved permutation codes for correcting a single burst of deletions,\u201d IEEE Commun. Lett., vol.25, no.1, pp.49-53, Jan. 2021. 10.1109\/lcomm.2020.3021749","DOI":"10.1109\/LCOMM.2020.3021749"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] H. Han, J. Mu, X. Jiao, Y.-C. He, and Z. Zhao, \u201cConstructions of multi-permutation codes correcting a single burst of deletions,\u201d Des. Codes Cryptogr., vol.91, pp.1923-1934, 2023. 10.1007\/s10623-023-01190-z","DOI":"10.1007\/s10623-023-01190-z"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] X. Wang and F.-W. Fu, \u201cRate-improved multi-permutation codes for correcting a single burst of stable deletions,\u201d Des. Codes Cryptogr., vol.93, no.6, pp.1725-1737, 2025. 10.1007\/s10623-025-01564-5","DOI":"10.1007\/s10623-025-01564-5"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] S. Wang, Y. Tang, R. Gabrys, and F. Farnoud, \u201cPermutation codes for correcting a burst of at most <i>t<\/i> deletions,\u201d 58th Allerton Conference on Communication, Control, and Computing, vol.1, pp.1-6, 2022. 10.1109\/Allerton49937.2022.9929395","DOI":"10.1109\/Allerton49937.2022.9929395"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] S. Wang, Y. Tang, J. Sima, R. Gabrys, and F. Farnoud, \u201cNon-binary codes for correcting a burst of at most <i>t<\/i> deletions,\u201d IEEE Trans. Inf. Theory, vol.70, no.2, pp.964-979, Feb. 2024. 10.1109\/tit.2023.3340246","DOI":"10.1109\/TIT.2023.3340246"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] L. Jin, \u201cA construction of permutation codes from rational function fields and improvement to the Gilbert Varshamov bound,\u201d IEEE Trans. Inf. Theory, vol.62, no.1, pp.159-162, 2015. 10.1109\/tit.2015.2500561","DOI":"10.1109\/TIT.2015.2500561"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] S. Wang, T. Nguyen, Y.M. Chee, and V.K. Vu, \u201cPermutation codes and multi-permutation codes correcting multiple deletions,\u201d arXiv preprint arXiv:2406.16656, 2024. 10.48550\/arXiv.2406.16656","DOI":"10.1109\/TIT.2025.3585691"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025EAL2041\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:11:16Z","timestamp":1772856676000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025EAL2041\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025eal2041","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025EAL2041"}}