{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:29:33Z","timestamp":1773775773253,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Greek General Secretariat for R&T"},{"name":"Ministry of Culture, Education & RA"},{"name":"European RDF"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1109\/lcomm.2015.2492965","type":"journal-article","created":{"date-parts":[[2015,10,20]],"date-time":"2015-10-20T18:24:11Z","timestamp":1445365451000},"page":"2074-2077","source":"Crossref","is-referenced-by-count":10,"title":["Approximated Box-Plus Decoding of LDPC Codes"],"prefix":"10.1109","volume":"19","author":[{"given":"Stylianos","family":"Papaharalabos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fotis","family":"Lazarakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"451","article-title":"$\\lambda$-min decoding algorithm of regular and irregular LDPC codes","author":"guilloud","year":"0","journal-title":"Proc Int Symp Turbo Codes and Rel Topics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658689"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2003.1290095"},{"key":"ref13","author":"mackay","year":"0","journal-title":"Online Database of Low-Density Parity-Check Codes"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1049\/el:20001357"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.822499"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref3","article-title":"Channel coding: Theory, algorithms, and applications","author":"paolini","year":"2014","journal-title":"Academic Press Library in Mobile and Wireless Communications"},{"key":"ref6","first-page":"1036","article-title":"Efficient implementations of the sum-product algorithm for decoding LDPC codes","author":"hu","year":"0","journal-title":"Proc IEEE Globecom"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/26.768759"},{"key":"ref8","first-page":"211","article-title":"Low-complexity belief propagation by approximations with lookup-tables","author":"clevorn","year":"0","journal-title":"Proc 5th Int ITG Conf SCC"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2005.1543380"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7349260\/07301997.pdf?arnumber=7301997","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:31Z","timestamp":1642003051000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7301997\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":15,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2015.2492965","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}