{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:23:05Z","timestamp":1764994985017,"version":"3.46.0"},"reference-count":12,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,12,1]]},"DOI":"10.1587\/transfun.2025eal2024","type":"journal-article","created":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T18:08:00Z","timestamp":1749665280000},"page":"1702-1705","source":"Crossref","is-referenced-by-count":0,"title":["A Class of Binary Linear Codes with Optimal Stopping Redundancy"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Yingnan","family":"QI","sequence":"first","affiliation":[{"name":"Institute of Microelectronics, Chinese Academy of Sciences"},{"name":"University of Chinese Academy of Sciences"}]},{"given":"Chuhong","family":"TANG","sequence":"additional","affiliation":[{"name":"Institute of Microelectronics, Chinese Academy of Sciences"},{"name":"University of Chinese Academy of Sciences"}]},{"given":"Haiyang","family":"LIU","sequence":"additional","affiliation":[{"name":"Institute of Microelectronics, Chinese Academy of Sciences"}]},{"given":"Lianrong","family":"MA","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Tsinghua University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] C. Di, D. Proietti, I.E. Telatar, T.J. Richardson, and R.L. Urbanke, \u201cFinite-length analysis of low-density parity-check codes on the binary erasure channel,\u201d IEEE Trans. Inf. Theory, vol.48, no.6, pp.1570-1579, June 2002. 10.1109\/tit.2002.1003839","DOI":"10.1109\/TIT.2002.1003839"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] M. Schwartz and A. Vardy, \u201cOn the stopping distance and the stopping redundancy of codes,\u201d IEEE Trans. Inf. Theory, vol.52, no.3, pp.922-932, March 2006. 10.1109\/tit.2005.864441","DOI":"10.1109\/TIT.2005.864441"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] J.H. Weber and K.A.S. Abdel-Ghaffar, \u201cResults on parity-check matrices with optimal stopping and\/or dead-end set enumerators,\u201d IEEE Trans. Inf. Theory, vol.54, no.3, pp.1368-1374, March 2008. 10.1109\/tit.2007.915923","DOI":"10.1109\/TIT.2007.915923"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] T. Etzion, \u201cOn the stopping redundancy of Reed-Muller codes,\u201d IEEE Trans. Inf. Theory, vol.52, no.11, pp.4867-4879, Nov. 2006. 10.1109\/tit.2006.883542","DOI":"10.1109\/TIT.2006.883542"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] M. Hivadi and M. Esmaeili, \u201cOn the stopping distance and stopping redundancy of product codes,\u201d IEICE Trans. Fundamentals, vol.E91-A, no.8, pp.2167-2173, Aug. 2008. 10.1093\/ietfec\/e91-a.8.2167","DOI":"10.1093\/ietfec\/e91-a.8.2167"},{"key":"6","unstructured":"[6] M. Esmaeili and V. Ravanmehr, \u201cStopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes,\u201d Utilitas Math., vol.76, pp.265-276, July 2008."},{"key":"7","unstructured":"[7] M. Esmaeili and V. Ravanmehr, \u201cTwo classes of optimal stopping redundancy codes,\u201d Ars Combinatoria, vol.92, pp.463-471, pp.2626-2639, July 2009."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Y. Qi, C. Tang, H. Liu, and L. Ma, \u201cBinary cycle codes have optimal stopping redundancy,\u201d IEICE Trans. Fundamentals, vol.E108-A, no.5, pp.764-768, May 2025. 10.1587\/transfun.2024eal2062","DOI":"10.1587\/transfun.2024EAL2062"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] S.K. Chilappagari, D.V. Nguyen, B. Vasic, and M.W. Marcellin, \u201cError correction capability of column-weight-three LDPC codes under the Gallager A algorithm\u2006\u2014\u2006Part II,\u201d IEEE Trans. Inf. Theory, vol.56, no.6, pp.2626-2639, June 2010. 10.1109\/tit.2010.2046203","DOI":"10.1109\/TIT.2010.2046203"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] S.K. Chilappagari and B. Vasic, \u201cError-correction capability of column-weight-three LDPC codes,\u201d IEEE Trans. Inf. Theory, vol.55, no.5, pp.2055-2061, May 2009. 10.1109\/tit.2009.2015990","DOI":"10.1109\/TIT.2009.2015990"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] D.V. Nguyen, M. Leslie, and B. Vasic, \u201cShort column-weight-three LDPC codes without small trapping sets,\u201d 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, pp.172-179, Sept. 2010. 10.1109\/ALLERTON.2010.5706904","DOI":"10.1109\/ALLERTON.2010.5706904"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[13] 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"}],"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\/E108.A\/12\/E108.A_2025EAL2024\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T03:24:48Z","timestamp":1764991488000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/12\/E108.A_2025EAL2024\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,1]]},"references-count":12,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025eal2024","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,12,1]]},"article-number":"2025EAL2024"}}