{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:16:43Z","timestamp":1761293803893,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/ict.2018.8464884","type":"proceedings-article","created":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T18:10:07Z","timestamp":1537207807000},"page":"236-240","source":"Crossref","is-referenced-by-count":5,"title":["Improved Maximum-Likelihood Decoding Using Sparse Parity-Check Matrices"],"prefix":"10.1109","author":[{"given":"Florian","family":"Gensheimer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Dietz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Ruzika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kira","family":"Kraft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Wehn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"2589","article-title":"Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels","author":"helmling","year":"2014","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"journal-title":"Decoding error-correcting codes via linear programming","year":"2003","author":"feldman","key":"ref3"},{"key":"ref10","first-page":"1","article-title":"Towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"4th International Symposium on Turbo Codes Related Topics 6th International ITG-Conference on Source and Channel Coding"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878176"},{"key":"ref11","first-page":"447","article-title":"Generating code representations suitable for belief propagation decoding","volume":"40","author":"yedidia","year":"1998","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"journal-title":"Database of Channel Codes and ML Simulation Results","year":"2017","author":"helmling","key":"ref5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2204955"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048489"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A Mathematical Theory of Communication","author":"shannon","year":"1948","journal-title":"Bell System Technical Journal"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460090308"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313063"}],"event":{"name":"2018 25th International Conference on Telecommunications (ICT)","start":{"date-parts":[[2018,6,26]]},"location":"St. Malo","end":{"date-parts":[[2018,6,28]]}},"container-title":["2018 25th International Conference on Telecommunications (ICT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8411300\/8464825\/08464884.pdf?arnumber=8464884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T20:17:19Z","timestamp":1539980239000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8464884\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ict.2018.8464884","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}