{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:07:35Z","timestamp":1764997655653,"version":"3.40.4"},"reference-count":17,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,5,1]]},"DOI":"10.1587\/transfun.2024eal2062","type":"journal-article","created":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T22:10:37Z","timestamp":1731363037000},"page":"764-768","source":"Crossref","is-referenced-by-count":1,"title":["Binary Cycle Codes Have 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, July 2009."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] S. Hakimi and J. Bredeson, \u201cGraph theoretic error-correcting codes,\u201d IEEE Trans. Inf. Theory, vol.IT-14, no.4, pp.584-591, July 1968. 10.1109\/tit.1968.1054190","DOI":"10.1109\/TIT.1968.1054190"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] R. Koetter, W.-C.W. Li, P.O. Vontobel, and J.L. Walker, \u201cCharacterizations of pseudo-codewords of (low-density) parity-check codes,\u201d Adv. Math., vol.213, no.1, pp.205-229, Aug. 2007. 10.1016\/j.aim.2006.12.010","DOI":"10.1016\/j.aim.2006.12.010"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] H.D. Pfister and P.O. Vontobel, \u201cOn the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes,\u201d Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, pp.3000-3004, July 2013. 10.1109\/isit.2013.6620776","DOI":"10.1109\/ISIT.2013.6620776"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] N. Axvig and D. Dreher, \u201cGraphical characterizations of linear programming pseudocodewords for cycle codes,\u201d IEEE Trans. Inf. Theory, vol.59, no.9, pp.5917-5934, 2013. 10.1109\/tit.2013.2265693","DOI":"10.1109\/TIT.2013.2265693"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] H. Liu and L. Ma, \u201cFurther results on the separating redundancy of binary linear codes,\u201d IEICE Trans. Fundamentals, vol.E102-A, no.10, pp.1420-1425, Oct. 2019. 10.1587\/transfun.e102.a.1420","DOI":"10.1587\/transfun.E102.A.1420"},{"key":"13","unstructured":"[13] R.J. Wilson. Introduction to Graph Theory, 5th ed., Prentice Hall, England, 2010."},{"key":"14","unstructured":"[14] S. Lin and D.J. Costello, Jr., Error Correcting Coding: Fundamentals and Applications, 2nd ed., Prentice-Hall, Upper Saddle River, NJ, 2004."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, \u201cStopping sets and the girth of Tanner graphs,\u201d Proc. IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, p.2, June-July, 2002. 10.1109\/isit.2002.1023274","DOI":"10.1109\/ISIT.2002.1023274"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] S.-T. Xia and F.-W. Fu, \u201cMinimum pseudoweight and minimum pseudocodewords of LDPC codes,\u201d IEEE Trans. Inf. Theory, vol.54, no.1, pp.480-485, Jan. 2008. 10.1109\/tit.2007.911177","DOI":"10.1109\/TIT.2007.911177"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] K.A.S. Abdel-Ghaffar and J.H. Weber, \u201cComplete enumeration of stopping sets of full-rank parity-check matrices of Hamming codes,\u201d IEEE Trans. Inf. Theory, vol.53, no.9, pp.3196-3201, Sept. 2007. 10.1109\/tit.2007.903137","DOI":"10.1109\/TIT.2007.903137"}],"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\/5\/E108.A_2024EAL2062\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T03:27:36Z","timestamp":1746242856000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/5\/E108.A_2024EAL2062\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,1]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024eal2062","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,5,1]]},"article-number":"2024EAL2062"}}