{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:30Z","timestamp":1773377790902,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849308","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2434-2438","source":"Crossref","is-referenced-by-count":2,"title":["A Modified Min-Sum Algorithm for Quantized LDPC Decoders"],"prefix":"10.1109","author":[{"given":"Homayoon","family":"Hatami","sequence":"first","affiliation":[{"name":"Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David G. M.","family":"Mitchell","sequence":"additional","affiliation":[{"name":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Costello","sequence":"additional","affiliation":[{"name":"Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Fuja","sequence":"additional","affiliation":[{"name":"Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.07.100508"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.112313.120917"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.111113.131881"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2006.1692544"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2009.2018915"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2014.2304660"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2517142"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.042712.100672"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.900611"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070325"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.836563"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref5","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"41st Annu Allerton Conf Commun Control Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.1603377"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/26.768759"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TCSI.2009.2016171","article-title":"Min-sum decoder architectures with reduced word length for LDPC codes","volume":"57","author":"oh","year":"2010","journal-title":"IEEE Trans Circuits Syst I"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2010.2042255"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref21","article-title":"Encyclopedia of sparse graph codes","author":"mackay","year":"0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SIPS.2004.1363033"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849308.pdf?arnumber=8849308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:10Z","timestamp":1773347710000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849308\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849308","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}