{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T02:44:21Z","timestamp":1745981061476},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icc.2005.1494430","type":"proceedings-article","created":{"date-parts":[[2005,8,16]],"date-time":"2005-08-16T15:17:27Z","timestamp":1124205447000},"page":"642-646","source":"Crossref","is-referenced-by-count":15,"title":["Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution"],"prefix":"10.1109","volume":"1","author":[{"given":"G.","family":"Richter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Bossert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ISIT.2002.1023727"},{"key":"ref11","first-page":"211","article-title":"Low-complexity belief propagation decoding by approximations with lookup-tables","author":"clevorn","year":"2004","journal-title":"5th Int ITG Conf Source and Channel Coding"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.1981.1056404"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/18.485714"},{"key":"ref14","article-title":"Regular and irregular progressive edge-growth tanner graphs","author":"hu","year":"2003","journal-title":"IEEE Trans on Inf Theory"},{"key":"ref4","article-title":"Comparison of constructions of irregular codes","author":"mackay","year":"1998","journal-title":"36th Allerton Conference Communications Control and Computing"},{"year":"1996","author":"wiberg","journal-title":"Codes and decoding on general graphs","key":"ref3"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/18.910575"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/18.910578"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/MILCOM.2003.1290095"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/4234.905935"},{"doi-asserted-by":"publisher","key":"ref2","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"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1049\/el:20010077"}],"event":{"name":"IEEE International Conference on Communications, 2005. ICC 2005. 2005","location":"Seoul, Korea"},"container-title":["IEEE International Conference on Communications, 2005. ICC 2005. 2005"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9996\/32109\/01494430.pdf?arnumber=1494430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T01:55:52Z","timestamp":1586397352000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1494430\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icc.2005.1494430","relation":{},"subject":[]}}