{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:30:51Z","timestamp":1762032651058},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"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":[[2007,4]]},"DOI":"10.1109\/tit.2007.892774","type":"journal-article","created":{"date-parts":[[2007,4,2]],"date-time":"2007-04-02T14:35:34Z","timestamp":1175524534000},"page":"1460-1478","source":"Crossref","is-referenced-by-count":11,"title":["Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights"],"prefix":"10.1109","volume":"53","author":[{"given":"Christine A.","family":"Kelley","sequence":"first","affiliation":[]},{"given":"Deepak","family":"Sridhara","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Rosenthal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365105"},{"key":"ref11","first-page":"75","article-title":"graph-covers and iterative decoding of finite length codes","author":"koetter","year":"2003","journal-title":"Proc IEEE Int Symp Turbo Codes and Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref13","year":"0","journal-title":"MAGMA Software"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01687.x"},{"key":"ref15","author":"van maldeghem","year":"1998","journal-title":"Generalized Polygons"},{"key":"ref16","author":"roberts","year":"1984","journal-title":"Applied Combinatorics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053994"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853330"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840867"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref3","author":"davey","year":"1999","journal-title":"Error-correction using low-density parity-check codes"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","volume":"123","author":"forney jr","year":"2001","journal-title":"Codes Systems and Graphical Models"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"Finite-length analysis of low-density parity-check codes on the binary erasure channel","volume":"48","author":"di","year":"2002","journal-title":"IEEE Trans Inf Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228136"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887513"},{"key":"ref2","first-page":"323","article-title":"on the application of the properties of galois fields to the problem of construction of hyper-graceo-latin squares","author":"bose","year":"1938","journal-title":"Sankhy&#x00E2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.37236\/1386"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref22","first-page":"248","article-title":"constructions of ldpc codes using ramanujan graphs and ideas from margulis","author":"rosenthal","year":"2000","journal-title":"Proc 38th Allerton Conf Communication Control and Computing"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref26","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref25","first-page":"223","article-title":"construction of codes based on finite generalized quadrangles for iterative decoding","author":"vontobel","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4137872\/04137889.pdf?arnumber=4137889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T02:28:29Z","timestamp":1640226509000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4137889\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":26,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2007.892774","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}