{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:12:42Z","timestamp":1704931962723},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2020,11,1]]},"DOI":"10.1587\/transcom.2019ebp3244","type":"journal-article","created":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T22:05:00Z","timestamp":1589925900000},"page":"1318-1330","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Concatenation Scheme of Protograph-Based LDPC Codes and Markers for Recovering Synchronous Errors"],"prefix":"10.23919","volume":"E103.B","author":[{"given":"Ryo","family":"SHIBATA","sequence":"first","affiliation":[{"name":"Dept. of Management Science, Graduate School of Engineering, Tokyo University of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gou","family":"HOSOYA","sequence":"additional","affiliation":[{"name":"Global Education Center, Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"YASHIMA","sequence":"additional","affiliation":[{"name":"Dept. of Information and Computer Technology, Faculty of Engineering, Tokyo University of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Y. Tang, K. Moon, and H.J. Lee, \u201cWrite synchronization in bit-patterned media,\u201d IEEE Trans. Magn., vol.45, no.2, pp.822-827, Feb. 2009. 10.1109\/tmag.2008.2010642","DOI":"10.1109\/TMAG.2008.2010642"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] C. Zhang, G. Sun, X. Zhang, W. Zhang, W. Zhao, T. Wang, Y. Liang, Y. Liu, Y. Wang, and J. Shu, \u201cHi-Fi playback: Tolerating position errors in shift operations of racetrack memory,\u201d Proc. ACM\/IEEE Annu. Int. Symp. on Computer Architecture (ISCA), pp.694-706, Portland, OR, USA, June 2015. 10.1145\/2749469.2750388","DOI":"10.1145\/2872887.2750388"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S.M.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, Sept. 2015. 10.1109\/tmbmc.2016.2537305","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] 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, Feb. 2010. 10.1109\/surv.2010.020110.00079","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] R. Gallager, \u201cLow-density parity-check codes,\u201d IRE Trans. Inf. Theory, vol.8, no.1, pp.21-28, Jan. 1962. 10.1109\/tit.1962.1057683","DOI":"10.1109\/TIT.1962.1057683"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] T.J. Richardson, M.A. Shokrollahi, and R.L. Urbanke, \u201cDesign of capacity-approaching irregular low-density parity-check codes,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.619-637, Feb. 2001. 10.1109\/18.910578","DOI":"10.1109\/18.910578"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] M.C. Davey and D.J.C. Mackay, \u201cReliable communication over channels with insertions, deletions, and substitutions,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.687-698, Feb. 2001. 10.1109\/18.910582","DOI":"10.1109\/18.910582"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] E.A. Ratzer, \u201cMarker codes for channels with insertions and deletions,\u201d Ann. Telecommun., vol.60, no.1, pp.29-44, Feb. 2005.","DOI":"10.1007\/BF03219806"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] F. Wang, D. Fertonani, and T.M. Duman, \u201cSymbol-level synchronization and LDPC code design for insertion\/deletion channels,\u201d IEEE Trans. Commun., vol.59, no.5, pp.1287-1297, May 2011. 10.1109\/tcomm.2011.030411.100546","DOI":"10.1109\/TCOMM.2011.030411.100546"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] R. Goto and K. Kasai, \u201cSparse graph codes for channels with synchronous errors,\u201d IEICE Trans. Fundamentals, vol.E101-A, no.12, pp.2064-2071, Dec. 2018. 10.1587\/transfun.e101.a.2064","DOI":"10.1587\/transfun.E101.A.2064"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] D.G.M. Mitchell, M. Lentmaier, and D.J. Costello, \u201cSpatially coupled LDPC codes constructed from protographs,\u201d IEEE Trans. Inf. Theory, vol.61, no.9, pp.4866-4889, Sept. 2015. 10.1109\/tit.2015.2453267","DOI":"10.1109\/TIT.2015.2453267"},{"key":"12","unstructured":"[12] J. Thorpe, \u201cLow-density parity-check (LDPC) codes constructed from protographs,\u201d IPN Progress Report, vol.154, pp.1-7, Aug. 2003."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] D. Divsalar, S. Dolinar, C.R. Jones, and K. Andrews, \u201cCapacity-approaching protograph codes,\u201d IEEE J. Sel. Areas Commun., vol.27, no.6, pp.876-888, Aug. 2009. 10.1109\/jsac.2009.090806","DOI":"10.1109\/JSAC.2009.090806"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] R. Shibata, G. Hosoya, and H. Yashima, \u201cStructured concatenation of protograph LDPC codes and markers for insertion\/deletion channels,\u201d Proc. International Symposium on Information Theory and Its Applications (ISITA), pp.374-378, Singapore, Singapore, Oct. 2018. 10.23919\/isita.2018.8664206","DOI":"10.23919\/ISITA.2018.8664206"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] X.-Y. Hu, E. Eleftheriou, and D.M. Arnold, \u201cRegular and irregular progressive edge-growth tanner graphs,\u201d IEEE Trans. Inf. Theory, vol.51, no.1, pp.386-398, Jan. 2005. 10.1109\/tit.2004.839541","DOI":"10.1109\/TIT.2004.839541"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] S. ten Brink, \u201cConvergence behavior of iteratively decoded parallel concatenated codes,\u201d IEEE Trans. Commun., vol.49, no.10, pp.1727-1737, Oct. 2001. 10.1109\/26.957394","DOI":"10.1109\/26.957394"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] G. Liva and M. Chiani, \u201cProtograph LDPC codes design based on EXIT analysis,\u201d Proc. IEEE Global Communications Conference (GLOBECOM), pp.3250-3254, Washington, DC, USA, Nov. 2007. 10.1109\/glocom.2007.616","DOI":"10.1109\/GLOCOM.2007.616"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] A. Kavcic, Xiao Ma, and M. Mitzenmacher, \u201cBinary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds,\u201d IEEE Trans. Inf. Theory, vol.49, no.7, pp.1636-1652, July 2003. 10.1109\/tit.2003.813563","DOI":"10.1109\/TIT.2003.813563"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] R. Storn and K. Price, \u201cDifferential evolution \u2014 A simple and efficient heuristic for global optimization over continuous spaces,\u201d J. Global Optim., vol.11, no.4, pp.341-359, Dec. 1997. 10.1023\/a:1008202821328","DOI":"10.1023\/A:1008202821328"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] S. Das and P.N. Suganthan, \u201cDifferential evolution: A survey of the state-of-the-art,\u201d IEEE Trans. Evol.Comput., vol.15, no.1, pp.4-31, Feb. 2011. 10.1109\/tevc.2010.2059031","DOI":"10.1109\/TEVC.2010.2059031"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] H. Uchikawa, \u201cDesign of non-precoded protograph-based LDPC codes,\u201d Proc. IEEE Int. Symp. on Information Theory (ISIT), pp.2779-2783, Honolulu, HI, USA, June 2014. 10.1109\/isit.2014.6875340","DOI":"10.1109\/ISIT.2014.6875340"},{"key":"22","unstructured":"[22] A.K. Pradhan, A. Subramanian, and A. Thangaraj, \u201cDeterministic constructions for large girth protograph LDPC codes,\u201d Proc. IEEE Int. Symp. on Information Theory (ISIT), pp.1680-1684, Istanbul, Turkey, June 2003. 10.1109\/isit.2013.6620513"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] C. Chen, L. Wang, and S. Liu, \u201cThe design of protograph LDPC codes as source codes in a JSCC system,\u201d IEEE Commun. Lett., vol.22, no.4, pp.672-675, April 2018. 10.1109\/lcomm.2018.2804382","DOI":"10.1109\/LCOMM.2018.2804382"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] S. Abu-Surra, D. Divsalar, and W.E. Ryan, \u201cOn the existence of typical minimum distance for protograph-based LDPC codes,\u201d Proc. Information Theory and Applications Workshop (ITA), pp.1-7, San Diego, CA, USA, Jan. 2010. 10.1109\/ita.2010.5454136","DOI":"10.1109\/ITA.2010.5454136"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] J. Hu, T.M. Duman, M.F. Erden, and A. Kavcic, \u201cAchievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs,\u201d IEEE Trans. Commun., vol.58, no.4, pp.1102-1111, April 2010. 10.1109\/tcomm.2010.04.080683","DOI":"10.1109\/TCOMM.2010.04.080683"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] D.M. Arnold, H.-A. Loeliger, P.O. Vontobel, A. Kavcic, and W. Zeng, \u201cSimulation-based computation of information rates for channels with memory,\u201d IEEE Trans. Inf. Theory, vol.52, no.8, pp.3498-3508, Aug. 2006. 10.1109\/tit.2006.878110","DOI":"10.1109\/TIT.2006.878110"},{"key":"27","unstructured":"[27] C. Di, R. Urbanke, and T. Richardson, \u201cWeight distributions: How deviant can you be?,\u201d Proc. IEEE Int. Symp. on Information Theory (ISIT), p.50, Washington, DC, USA, June 2001. 10.1109\/isit.2001.935913"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] M. Franceschini, G. Ferrari, and R. Raheli, \u201cDoes the performance of LDPC codes depend on the channel?,\u201d IEEE Trans. Commun., vol.54, no.12, pp.2129-2132, Dec. 2006. 10.1109\/tcomm.2006.885042","DOI":"10.1109\/TCOMM.2006.885042"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] P.M. Olmos and R. Urbanke, \u201cScaling behavior of convolutional LDPC ensembles over the BEC,\u201d Proc. IEEE Int. Symp. on Information Theory (ISIT), pp.1816-1820, St. Petersburg, Russia, July 2011. 10.1109\/isit.2011.6033863","DOI":"10.1109\/ISIT.2011.6033863"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E103.B\/11\/E103.B_2019EBP3244\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:58:21Z","timestamp":1704898701000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E103.B\/11\/E103.B_2019EBP3244\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,1]]},"references-count":29,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2019ebp3244","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,1]]}}}