{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:04Z","timestamp":1773377044009,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2145917,HRD-1914635"],"award-info":[{"award-number":["CCF-2145917,HRD-1914635"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195322","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["High-Rate Spatially Coupled LDPC Codes Based on Massey's Convolutional Self-Orthogonal Codes"],"prefix":"10.1109","author":[{"given":"Daniel J.","family":"Costello","sequence":"first","affiliation":[{"name":"University of Notre Dame,Department of Electrical Engineering,Notre Dame,IN,USA"}]},{"given":"Min","family":"Zhu","sequence":"additional","affiliation":[{"name":"Xidian University,State Key Laboratory of ISN,Xi'an,P. R. China"}]},{"given":"David G. M.","family":"Mitchell","sequence":"additional","affiliation":[{"name":"Klipsch School of Electrical and Computer Engineering, New Mexico State University,Las Cruces,NM,USA"}]},{"given":"Michael","family":"Lentmaier","sequence":"additional","affiliation":[{"name":"Lund University,Department of Electrical and Information Technology,Lund,Sweden"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177439"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2011.2175479"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.21236\/ad0407946"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2453267"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053951"},{"issue":"154","key":"ref9","first-page":"42","article-title":"Low-density parity-check (LDPC) codes constructed from protographs","volume-title":"IPN progress report","volume":"42","author":"Thorpe","year":"2003"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092903"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1976.1093201"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054438"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.847135"},{"key":"ref14","article-title":"Moderate-density parity-check codes","volume":"abs\/0911.3262","author":"Ouzan","year":"2009","journal-title":"CoRR"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3001029"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2867493"},{"key":"ref17","article-title":"Highrate spatially coupled LDPC codes based on Massey\u2019s convolutional selforthogonal codes","author":"Costello","year":"2025","journal-title":"arxiv"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2397433"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2342735"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC57237.2023.10273481"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.616"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195322.pdf?arnumber=11195322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:16Z","timestamp":1773347416000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195322\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195322","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}