{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:25:30Z","timestamp":1729661130618,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034183","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"523-527","source":"Crossref","is-referenced-by-count":5,"title":["Linear growing minimum distance of ultra-sparse non-binary cluster-LDPC codes"],"prefix":"10.1109","author":[{"given":"Valentin","family":"Savin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Declercq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.910591"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90112-F"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"ref13","first-page":"39","article-title":"Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators","volume":"24","author":"margulis","year":"1988","journal-title":"Problems Inform Transmission"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"ref15","first-page":"248","article-title":"Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis","author":"rosenthal","year":"2000","journal-title":"Proc of the 38-th Allerton Conf on Comm Control and Comp"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1090\/memo\/0910"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595332"},{"article-title":"Webpage","year":"0","author":"mackay","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.767979"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059910"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.071843"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060527"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050230"},{"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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894089"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.857165"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034183.pdf?arnumber=6034183","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T04:18:41Z","timestamp":1560745121000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034183\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034183","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}