{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T03:19:01Z","timestamp":1770347941986,"version":"3.49.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","award":["ICT12-054"],"award-info":[{"award-number":["ICT12-054"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","award":["ICT15-119"],"award-info":[{"award-number":["ICT15-119"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","award":["NXT17-013"],"award-info":[{"award-number":["NXT17-013"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tcomm.2019.2944159","type":"journal-article","created":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T02:45:25Z","timestamp":1569638725000},"page":"1329-1343","source":"Crossref","is-referenced-by-count":24,"title":["Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3944-9855","authenticated-orcid":false,"given":"Michael","family":"Meidlinger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1784-806X","authenticated-orcid":false,"given":"Gerald","family":"Matz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7270-5558","authenticated-orcid":false,"given":"Andreas","family":"Burg","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref38","article-title":"Dynamic programming for sequential deterministic quantization of discrete memoryless channels","author":"he","year":"2019","journal-title":"arXiv 1901 01659"},{"key":"ref33","article-title":"Information-optimal decoding and demodulation on sparse graphs","author":"meidlinger","year":"2018"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2015.7227051"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.485714"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2015.7124674"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874821"},{"key":"ref35","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref34","first-page":"368","article-title":"The information bottleneck method","author":"tishby","year":"1999","journal-title":"Proc 37th Allerton Conf Commun Control Comput"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2006.248146"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/BSC.2006.1644559"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.836563"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2001.922207"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.11.080105"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284049"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2008.ECP.214"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPCS.2015.7391731"},{"key":"ref18","first-page":"1","article-title":"Optimum message mapping LDPC decoders derived from the sum-product algorithm","author":"lewandowsky","year":"2016","journal-title":"Proc IEEE Int Conf Commun (ICC)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2797694"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/18.910576","article-title":"improved low-density parity-check codes using irregular graphs","volume":"47","author":"luby","year":"2001","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref6","first-page":"243","article-title":"LDPC-in-SSD: Making advanced error correction codes work effectively in solid state drives","author":"zhao","year":"2013","journal-title":"Proc of the 11th USENIX FAST"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref8","year":"2014","journal-title":"Second Generation Framing Structure Channel Coding and Modulation Systems for Broadcasting Interactive Services News Gathering and Other Broadband Satellite Applications"},{"key":"ref7","first-page":"1","article-title":"Soft information for LDPC decoding in flash: Mutual-information optimized quantization","author":"wang","year":"2011","journal-title":"Proc IEEE Global Commun Conf (GLOBECOM)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2017.8227780"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2012.6272299"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421419"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.090513.120444"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2603708"},{"key":"ref21","first-page":"426","article-title":"Decoding LDPC codes with mutual information-maximizing lookup tables","author":"romero","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/app8101884"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312997"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2006.18.8.1739"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2766925"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS.2015.7345024"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9039763\/08851267.pdf?arnumber=8851267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:46:57Z","timestamp":1651067217000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8851267\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":41,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2019.2944159","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}