{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:38:59Z","timestamp":1729658339244,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205662","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"65-69","source":"Crossref","is-referenced-by-count":9,"title":["Binary weight distribution of non-binary LDPC codes"],"prefix":"10.1109","author":[{"given":"Iryna","family":"Andriyanova","sequence":"first","affiliation":[]},{"given":"Vishwambhar","family":"Rathi","sequence":"additional","affiliation":[]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"article-title":"the average case analysis of algorithms: saddle point asymptotics","year":"1994","author":"flajolet","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011443"},{"key":"12","article-title":"weight distribution of non-binary ldpc codes","author":"kasai","year":"2008","journal-title":"Proc ISIT"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2001.955136"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050230"},{"article-title":"weight distributions of nonbinary ldpc codes","year":"0","author":"andriyanova","key":"1"},{"key":"10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/070686615","article-title":"average spectra and minimum distances of low density parity check codes over abelian groups","volume":"23","author":"como","year":"2008","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"7","article-title":"using binary images of nonbinary ldpc codes to improve overall performance","author":"poulliat","year":"2006","journal-title":"Proc Int Symp Turbo Codes"},{"article-title":"low-delay low-complexity error-correcting codes on sparse graphs","year":"2002","author":"hu","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"year":"0","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557389"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205662.pdf?arnumber=5205662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T19:05:26Z","timestamp":1497812726000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205662\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205662","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}