{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:55Z","timestamp":1725455935073},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1109\/softcom.2016.7772157","type":"proceedings-article","created":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T16:40:15Z","timestamp":1482165615000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Lowering the error floor of short-to-medium length LDPC codes using optimal low-correlated-edge density (OED) PEG Tanner graphs"],"prefix":"10.1109","author":[{"given":"Umar-Faruk","family":"Abdu-Aguye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel Adrian","family":"Ambroze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Tomlinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.839612"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254897"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.071457"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.050658"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.060112.120844"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.782170"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021305"},{"journal-title":"A study of linear error correcting codes","year":"2007","author":"tjhai","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2171531"},{"journal-title":"An efficient algorithm for determining the girth and ACE distributions in LDPC code Tanner graphs","year":"0","author":"abdu-aguye","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"journal-title":"Codes and decoding on general graphs","year":"1996","author":"wiberg","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276756"},{"key":"ref8","first-page":"995","article-title":"Progressive edge growth Tanner graphs","author":"hu","year":"2001","journal-title":"Proc GLOBECOM 2001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"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\/TIT.2004.839541"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2496213"}],"event":{"name":"2016 24th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","start":{"date-parts":[[2016,9,22]]},"location":"Split, Croatia","end":{"date-parts":[[2016,9,24]]}},"container-title":["2016 24th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7754733\/7772099\/07772157.pdf?arnumber=7772157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T22:53:09Z","timestamp":1601247189000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7772157\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/softcom.2016.7772157","relation":{},"subject":[],"published":{"date-parts":[[2016,9]]}}}