{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:44:26Z","timestamp":1729658666830,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6284267","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"621-625","source":"Crossref","is-referenced-by-count":5,"title":["Capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel"],"prefix":"10.1109","author":[{"given":"A. Makhdoumi","family":"Kakhaki","sequence":"first","affiliation":[]},{"given":"H. Karkeh","family":"Abadi","sequence":"additional","affiliation":[]},{"given":"P.","family":"Pad","sequence":"additional","affiliation":[]},{"given":"H.","family":"Saeedi","sequence":"additional","affiliation":[]},{"given":"F.","family":"Marvasti","sequence":"additional","affiliation":[]},{"given":"K.","family":"Alishahi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Large Deviation Techniques and Application","year":"2009","author":"dembo","key":"17"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"journal-title":"\"Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices \" [Online]","year":"0","author":"makhdoumi kakhaki","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.813816"},{"key":"12","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/TIT.2009.2039084","article-title":"Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding","volume":"56","author":"chun-hao","year":"2010","journal-title":"IEEE Transactions Information Theory"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"journal-title":"Transmisson of Information","year":"1961","author":"fano","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.112310.090086"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.335935"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800480"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"4","first-page":"204","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1049\/el:19970362"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06284267.pdf?arnumber=6284267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T23:28:42Z","timestamp":1498001322000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6284267\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6284267","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}