{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:42:23Z","timestamp":1730274143376,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282985","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T22:09:52Z","timestamp":1443737392000},"page":"2889-2893","source":"Crossref","is-referenced-by-count":0,"title":["Ensemble weight enumerators for protographs: A proof of Abu Surra's conjecture and a continuous relaxation for a faster enumeration"],"prefix":"10.1109","author":[{"given":"Tarik","family":"Benaddi","sequence":"first","affiliation":[]},{"given":"Charly","family":"Poulliat","sequence":"additional","affiliation":[]},{"given":"Marie-Laure","family":"Boucheret","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Gadat","sequence":"additional","affiliation":[]},{"given":"Guy","family":"Lesthievent","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Spatially coupled ldpc codes constructed from protographs","author":"mitchell","year":"2014","journal-title":"arXiv preprint arXiv 1407 5366"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620551"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100030401"},{"journal-title":"Theory of Linear and Integer Programming","year":"1998","author":"schrijver","key":"ref14"},{"journal-title":"Elements of Information Theory","year":"2012","author":"cover","key":"ref15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523728"},{"key":"ref3","first-page":"201","article-title":"Coding theorems for turbo-like codes","volume":"36","author":"divsalar","year":"1998","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262129"},{"key":"ref5","first-page":"42","article-title":"Low-density parity-checks codes (ldpc) constructed from protographs","author":"thorpe","year":"2003","journal-title":"IPN Progress Report"},{"key":"ref8","article-title":"Can a system of linear diophantine equations be solved in strongly polynomial time?","author":"hochbaum","year":"1994","journal-title":"CiteSeer"},{"article-title":"Protograph-based generalized ldpc codes: Enumer-ators, design, and applications","year":"2009","author":"abu-surra","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094819"},{"journal-title":"Circulant Matrices","year":"1979","author":"davis","key":"ref9"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282985.pdf?arnumber=7282985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T20:55:07Z","timestamp":1490388907000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282985\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282985","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}