{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:30:27Z","timestamp":1774679427607,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/tit.2022.3225592","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:29:02Z","timestamp":1669854542000},"page":"2152-2164","source":"Crossref","is-referenced-by-count":3,"title":["Codebook Mismatch can be Fully Compensated by Mismatched Decoding"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9547-3243","authenticated-orcid":false,"given":"Neri","family":"Merhav","sequence":"first","affiliation":[{"name":"Andrew and Erna Viterbi Faculty of Electrical Engineering, Technion&#x2014;Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9418-9921","authenticated-orcid":false,"given":"Georg","family":"B\u00f6cherer","sequence":"additional","affiliation":[{"name":"Munich Research Center, Huawei Technologies Duesseldorf GmbH, D&#x00FC;sseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056281"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2496308"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00107-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054746"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613306"},{"key":"ref1","article-title":"Theoretic shaping bounds for single letter constraints and mismatched decoding","author":"achtenberg","year":"2013","journal-title":"arXiv 1308 5938"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.887846"},{"key":"ref16","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref19","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3390\/e22070762"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2890595"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2499181"},{"key":"ref26","author":"stolte","year":"2002","journal-title":"Rekursive codes mit der Plotkin-Konstruktion und ihre decodierung"},{"key":"ref25","author":"schulte","year":"2020","journal-title":"Algorithms for distribution matching"},{"key":"ref20","author":"mceliece","year":"1984","journal-title":"The Theory of Information and Coding"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310453"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.340469"},{"key":"ref28","author":"viterbi","year":"1979","journal-title":"Principles of Digital Communication and Coding"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-3158-9"},{"key":"ref8","first-page":"12","article-title":"Probabilistic shaping: A random coding experiment","author":"bocherer","year":"2020","journal-title":"Proc Int Zurich Seminar Commun"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2019.2895770"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2494016"},{"key":"ref4","article-title":"Achievable rates for shaped bit-metric decoding","author":"b\u00f6cherer","year":"2014","journal-title":"arXiv 1410 8075"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref6","article-title":"Probabilistic parity shaping for linear codes","author":"b\u00f6cherer","year":"2019","journal-title":"arXiv 1902 10648"},{"key":"ref5","author":"b\u00f6cherer","year":"2018","journal-title":"Principles of Coded Modulation"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10073961\/09966730.pdf?arnumber=9966730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T19:08:46Z","timestamp":1681153726000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9966730\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":28,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3225592","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}