{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:36:15Z","timestamp":1725734175712},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006550","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"361-365","source":"Crossref","is-referenced-by-count":12,"title":["Average spectra for ensembles of LDPC codes and applications"],"prefix":"10.1109","author":[{"given":"Irina E.","family":"Bocharova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris D.","family":"Kudryashov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yauhen","family":"Yakimenka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref11","article-title":"Bounds on the average binary minimum distance and the maximum likelihood performance of Reed Solomon codes","author":"el-khamy","year":"2004","journal-title":"42nd AllertonConf on Communication Control and Computing"},{"journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes","year":"0","author":"grassl","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.888996"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006456"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887513"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917624"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133087"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842571"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E94.A.1106"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2316215"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006637"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"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.1016\/j.jmaa.2013.03.009"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006550.pdf?arnumber=8006550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T14:58:42Z","timestamp":1602860322000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006550","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}