{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:16:31Z","timestamp":1759331791868},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007065","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"2925-2929","source":"Crossref","is-referenced-by-count":13,"title":["Message alignment for discrete LDPC decoders with quadrature amplitude modulation"],"prefix":"10.1109","author":[{"given":"Jan","family":"Lewandowsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian","family":"Stark","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Bauch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"453","article-title":"Low-complexity quantization of discrete memoryless channels","author":"zhang","year":"2016","journal-title":"International Symposium on Information Theory and Its Applications ISITA IEEE"},{"key":"ref11","article-title":"The information bottleneck method","author":"tishby","year":"1999","journal-title":"Proc 37th Allerton Conf Communication and Computation"},{"journal-title":"The Information Bottleneck Theory and Applications","year":"2002","author":"slonim","key":"ref12"},{"key":"ref13","first-page":"1602","article-title":"IEEE Standard for Information Technology - Telecommunications and information exchange between systems - Local and metropolitan area network - Specific requirements - Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications","year":"2012","journal-title":"IEEE Std 802 11&#x2013;2012"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282490"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2603708"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510906"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPCS.2015.7391731"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2008.ECP.214"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541827"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS.2015.7345024"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.1032"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327016"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08007065.pdf?arnumber=8007065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T04:46:25Z","timestamp":1504759585000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007065\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007065","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}