{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:54:34Z","timestamp":1730274874636,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/isit.2007.4557316","type":"proceedings-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T00:17:12Z","timestamp":1215562632000},"page":"761-765","source":"Crossref","is-referenced-by-count":4,"title":["A Combinatorial Family of Near Regular LDPC Codes"],"prefix":"10.1109","author":[{"given":"K. Murali","family":"Krishnan","sequence":"first","affiliation":[]},{"given":"Rajdeep","family":"Singh","sequence":"additional","affiliation":[]},{"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[]},{"given":"Priti","family":"Shankar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"MIT Press","article-title":"Low density parity-check codes","year":"1963","author":"gallager","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"journal-title":"arXiv cs IT\/0504013","article-title":"Pseudocodewords of Tanner Graphs","year":"2005","author":"kelley","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910576"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828088"},{"key":"ref16","article-title":"Combinatorial constructions of low density parity check codes for iterative decoding","volume":"50","author":"vasic","year":"2001","journal-title":"IEEE Trans Info Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref18","article-title":"constructionsof regular andirregular LDPCcodes usingRamanujan graphs and ideas from Margulis","volume":"4","author":"rosenthal","year":"2001","journal-title":"Proc ISII 2001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1203996"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023274"},{"journal-title":"ICC 2004 Paris","article-title":"Construction of short block length irregular LDPC codes","year":"2004","author":"ramamoorthy","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101387893"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"article-title":"Online Database of Low-Density Parity-Check Codes","year":"0","author":"mackay","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.832776"},{"journal-title":"Proc ICSTA 2001 Ambleside England","article-title":"A class of group structured LDPC codes","year":"2001","author":"tanner","key":"ref9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.910593"}],"event":{"name":"2007 IEEE International Symposium on Information Theory","start":{"date-parts":[[2007,6,24]]},"location":"Nice","end":{"date-parts":[[2007,6,29]]}},"container-title":["2007 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4497218\/4557062\/04557316.pdf?arnumber=4557316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T13:06:46Z","timestamp":1489669606000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4557316\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1109\/isit.2007.4557316","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}
