{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:43:05Z","timestamp":1775054585822,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/tit.2013.2250574","type":"journal-article","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T19:11:19Z","timestamp":1371237079000},"page":"4598-4614","source":"Crossref","is-referenced-by-count":30,"title":["Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles"],"prefix":"10.1109","volume":"59","author":[{"given":"Hosung","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seokbeom","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong-Seon","family":"No","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong-Joon","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.101210.090757"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2011.6157428"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2176717"},{"key":"ref13","article-title":"Quasi-cyclic LDPC codes from difference families","author":"johnson","year":"2002","journal-title":"IEEE Australian Commun Theory Workshop"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828144"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828066"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595095"},{"key":"ref17","first-page":"75","article-title":"Graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Int Symp Turbo Codes Related Top"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.11.053"},{"key":"ref3","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Int Symp Commun Theory Appl"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878179"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862120"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658694"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TIT.2007.901193","article-title":"Quasi-cyclic low-density parity-check codes with girth larger than 12","volume":"53","author":"kim","year":"2007","journal-title":"IEEE Trans Inf Theory"},{"key":"ref2","author":"thorpe","year":"2003","journal-title":"Low-density parity-check (LDPC) codes constructed from protograph"},{"key":"ref9","first-page":"202","article-title":"Structured quasi-cyclic LDPC codes with girth 18 and column-weight <formula formulatype=\"inline\"><tex Notation=\"TeX\">$J\\geq 3$<\/tex><\/formula>","volume":"64","author":"esmaeili","year":"2010","journal-title":"J Electron Commun"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253152"},{"key":"ref22","first-page":"235","article-title":"A list of balanced ternary designs with <formula formulatype=\"inline\"><tex Notation=\"TeX\">$R\\leq 15$<\/tex> <\/formula>, and some necessary existence conditions","volume":"16","author":"billington","year":"1983","journal-title":"Ars Combin"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1201\/9781420049954","author":"colbourn","year":"1996","journal-title":"The CRC Handbook of Combinatorial Designs"},{"key":"ref24","first-page":"1990","article-title":"A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph","author":"li","year":"2004","journal-title":"Proc 38th Asilomar Conf Sig Syst Comput"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref26","year":"0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90087-6"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6530620\/06472317.pdf?arnumber=6472317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:45Z","timestamp":1638218865000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6472317\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":27,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2250574","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}