{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T00:14:36Z","timestamp":1715213676302},"reference-count":32,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2022,1,1]]},"DOI":"10.1587\/transfun.2020eap1147","type":"journal-article","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T22:07:41Z","timestamp":1625177261000},"page":"35-43","source":"Crossref","is-referenced-by-count":1,"title":["Construction and Encoding Algorithm for Maximum Run-Length Limited Single Insertion\/Deletion Correcting Code"],"prefix":"10.1587","volume":"E105.A","author":[{"given":"Reona","family":"TAKEMOTO","sequence":"first","affiliation":[{"name":"Dept. of Informatics, Division of Fundamental Sciences, Graduate School of Sciences and Technology for Innovation, Yamaguchi University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayuki","family":"NOZAKI","sequence":"additional","affiliation":[{"name":"Dept. of Informatics, Division of Fundamental Sciences, Graduate School of Sciences and Technology for Innovation, Yamaguchi University"},{"name":"The Research Institute for Time Studies, Yamaguchi University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] R. Takemoto and T. Nozaki, \u201cEncoding algorithm for run-length limited single insertion\/deletion correcting code,\u201d 2020 International Symposium on Information Theory and Its Applications (ISITA), pp.294-298, Oct. 2020. 10.34385\/proc.65.B06-5","DOI":"10.34385\/proc.65.B06-5"},{"key":"2","unstructured":"[2] K.A.S. Immink, Codes for Mass Data Storage Systems, Shannon Foundation Publisher, 2004."},{"key":"3","unstructured":"[3] R. Varshamov and G. Tenengolts, \u201cCodes which correct single asymmetric errors,\u201d Avtomatica i Telemekhanika, vol.26, pp.288-292, 1965."},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] G. Tenengolts, \u201cNonbinary codes, correcting single deletion or insertion (corresp.),\u201d IEEE Trans. Inf. Theory, vol.30, no.5, pp.766-769, 1984. 10.1109\/tit.1984.1056962","DOI":"10.1109\/TIT.1984.1056962"},{"key":"5","unstructured":"[5] V. Levenshtein, \u201cBinary codes capable of correcting deletions, insertions, and reversals,\u201d Soviet Physics Doklady, pp.707-710, 1966."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] K. Bibak and O. Milenkovic, \u201cWeight enumerators of some classes of deletion correcting codes,\u201d 2018 IEEE International Symposium on Information Theory (ISIT), pp.431-435, June 2018. 10.1109\/isit.2018.8437121","DOI":"10.1109\/ISIT.2018.8437121"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T. Nozaki, \u201cBounded single insertion\/deletion correcting codes,\u201d 2019 IEEE International Symposium on Information Theory (ISIT), pp.2379-2383, June 2019. 10.1109\/isit.2019.8849583","DOI":"10.1109\/ISIT.2019.8849583"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] T. Nozaki, \u201cWeight enumerators for number-theoretic codes and cardinalities of Tenengolts&apos; non-binary codes,\u201d 2020 IEEE International Symposium on Information Theory (ISIT), pp.729-733, June 2020. 10.1109\/isit44484.2020.9173950","DOI":"10.1109\/ISIT44484.2020.9173950"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] M.C. Davey and D.J. MacKay, \u201cReliable communication over channels with insertions, deletions, and substitutions,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.687-698, 2001. 10.1109\/18.910582","DOI":"10.1109\/18.910582"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] H. Koremura and H. Kaneko, \u201cInsertion\/deletion\/substitution error correction by a modified successive cancellation decoding of polar code,\u201d IEICE Trans. Fundamentals, vol.103, no.4, pp.695-703, April 2020. 10.1587\/transfun.2019eap1079","DOI":"10.1587\/transfun.2019EAP1079"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] R. Shibata, G. Hosoya, and H. Yashima, \u201cDesign and construction of irregular LDPC codes for channels with synchronization errors: New aspect of degree profiles,\u201d IEICE Trans. Fundamentals, vol.E103-A, no.10, pp.1237-1247, Oct. 2020. 10.1587\/transfun.2020eap1004","DOI":"10.1587\/transfun.2020EAP1004"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] R. Shibata, G. Hosoya, and H. Yashima, \u201cConcatenated LDPC\/trellis codes: Surpassing the symmetric information rate of channels with synchronization errors,\u201d IEICE Trans. Fundamentals, vol.E103-A, no.11, pp.1283-1291, Nov. 2020. 10.1587\/transfun.2020eap1019","DOI":"10.1587\/transfun.2020EAP1019"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] H. Mercier, V.K. Bhargava, and V. Tarokh, \u201cA survey of error-correcting codes for channels with symbol synchronization errors,\u201d IEEE Commun. Surveys Tuts., vol.12, no.1, pp.87-96, 2010. 10.1109\/surv.2010.020110.00079","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] S.H.T. Yazdi, H.M. Kiah, E. Garcia-Ruiz, J. Ma, H. Zhao, and O. Milenkovic, \u201cDNA-based storage: Trends and methods,\u201d IEEE Trans. Mol. Biol. Multi-Scale Commun., vol.1, no.3, pp.230-248, 2015. 10.1109\/tmbmc.2016.2537305","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] M.G. Ross, C. Russ, M. Costello, A. Hollinger, N.J. Lennon, R. Hegarty, C. Nusbaum, and D.B. Jaffe, \u201cCharacterizing and measuring bias in sequence data,\u201d Genome Biol., vol.14, no.5, p.R51, 2013. 10.1186\/gb-2013-14-5-r51","DOI":"10.1186\/gb-2013-14-5-r51"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] R. Heckel, G. Mikutis, and R.N. Grass, \u201cA characterization of the DNA data storage channel,\u201d Scientific Reports, vol.9, no.1, pp.1-12, 2019. 10.1038\/s41598-019-45832-6","DOI":"10.1038\/s41598-019-45832-6"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] K.A.S. Immink and K. Cai, \u201cProperties and constructions of constrained codes for DNA-based data storage,\u201d IEEE Access, vol.8, pp.49523-49531, 2020. 10.1109\/access.2020.2980036","DOI":"10.1109\/ACCESS.2020.2980036"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] Y.M. Chee, H.M. Kiah, and T.T. Nguyen, \u201cLinear-time encoders for codes correcting a single edit for DNA-based data storage,\u201d 2019 IEEE International Symposium on Information Theory (ISIT), pp.772-776, June 2019. 10.1109\/isit.2019.8849643","DOI":"10.1109\/ISIT.2019.8849643"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] K. Cai, X. He, H.M. Kiah, and T.T. Nguyen, \u201cEfficient constrained encoders correcting a single nucleotide edit in DNA storage,\u201d 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.8827-8830, May 2020. 10.1109\/icassp40776.2020.9053256","DOI":"10.1109\/ICASSP40776.2020.9053256"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] C. Schoeny, A. Wachter-Zeh, R. Gabrys, and E. Yaakobi, \u201cCodes correcting a burst of deletions or insertions,\u201d IEEE Trans. Inf. Theory, vol.63, no.4, pp.1971-1985, 2017. 10.1109\/TIT.2017.2661747","DOI":"10.1109\/TIT.2017.2661747"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] C. Schoeny, F. Sala, and L. Dolecek, \u201cNovel combinatorial coding results for DNA sequencing and data storage,\u201d 2017 51st Asilomar Conference on Signals, Systems, and Computers, pp.511-515, Oct. 2017. 10.1109\/acssc.2017.8335392","DOI":"10.1109\/ACSSC.2017.8335392"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] T. Saeki and T. Nozaki, \u201cAn improvement of non-binary single <i>b<\/i>-burst of insertion\/deletion correcting code,\u201d IEICE Trans. Fundamentals, vol.E102-A, no.12, pp.1591-1599, Dec. 2019. 10.1587\/transfun.e102.a.1591","DOI":"10.1587\/transfun.E102.A.1591"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] A. Lenz and N. Polyanskii, \u201cOptimal codes correcting a burst of deletions of variable length,\u201d 2020 IEEE International Symposium on Information Theory (ISIT), pp.757-762, June 2020. 10.1109\/isit44484.2020.9174288","DOI":"10.1109\/ISIT44484.2020.9174288"},{"key":"24","unstructured":"[24] T. Saeki and T. Nozaki, \u201cSystematic encoding algorithms for binary and non-binary shifted VT codes,\u201d IEICE Technical Report, vol.118, no.478, pp.307-312, 2019 (in japanese)."},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] K.A. Abdel-Ghaffar and H.C. Ferreira, \u201cSystematic encoding of the Varshamov-Tenengol&apos;ts codes and the Constantin-Rao codes,\u201d IEEE Trans. Inf. Theory, vol.44, no.1, pp.340-345, 1998. 10.1109\/18.651063","DOI":"10.1109\/18.651063"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] M. Mansuripur, \u201cEnumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems,\u201d Optical Data Storage&apos;91, vol.1499, pp.72-86, 1991. 10.1117\/12.45930","DOI":"10.1117\/12.45930"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] K.A.S. Immink, \u201cA practical method for approaching the channel capacity of constrained channels,\u201d IEEE Trans. Inf. Theory, vol.43, no.5, pp.1389-1399, 1997. 10.1109\/18.623139","DOI":"10.1109\/18.623139"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] A. Wijngaarden and K. Immink, \u201cConstruction of maximum run-length limited codes using sequence replacement techiques,\u201d IEEE Trans. Inf. Theory, vol.28, no.2, pp.200-207, 2010. 10.1109\/jsac.2010.100209","DOI":"10.1109\/JSAC.2010.100209"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] M. Hagiwara, \u201cOn ordered syndromes for multi insertion\/deletion error-correcting codes,\u201d 2016 IEEE International Symposium on Information Theory (ISIT), pp.625-629, July 2016. 10.1109\/isit.2016.7541374","DOI":"10.1109\/ISIT.2016.7541374"},{"key":"30","unstructured":"[30] H. Takahashi and M. Hagiwara, \u201cDecoding algorithms of monotone codes and Azinv codes and their unified view,\u201d 2020 International Symposium on Information Theory and Its Applications (ISITA), pp.284-288, Oct. 2020."},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] N.J. Sloane, \u201cOn single-deletion-correcting codes,\u201d Codes and Designs, vol.10, pp.273-291, 2000.","DOI":"10.1515\/9783110198119.273"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] A.A. Kulkarni and N. Kiyavash, \u201cNonasymptotic upper bounds for deletion correcting codes,\u201d IEEE Trans. Inf. Theory, vol.59, no.8, pp.5115-5130, 2013. 10.1109\/tit.2013.2257917","DOI":"10.1109\/TIT.2013.2257917"}],"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\/E105.A\/1\/E105.A_2020EAP1147\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T04:39:05Z","timestamp":1715143145000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/1\/E105.A_2020EAP1147\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020eap1147","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,1]]},"article-number":"2020EAP1147"}}