{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:55:43Z","timestamp":1762505743111},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1109\/dcc.2011.10","type":"proceedings-article","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T13:43:38Z","timestamp":1302615818000},"page":"23-32","source":"Crossref","is-referenced-by-count":44,"title":["Matching Dyadic Distributions to Channels"],"prefix":"10.1109","author":[{"given":"G.","family":"Bocherer","sequence":"first","affiliation":[]},{"given":"R.","family":"Mathar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813498"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(62)90183-3"},{"journal-title":"Discrete Noiseless Coding","year":"1957","author":"marcus","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1524-0_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0895-3_17"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.79932"},{"key":"ref6","article-title":"Capacity achieving modulation for fixed constellations with average power constraint","author":"bocherer","year":"2010","journal-title":"ICC 2011"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.681344"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref8"},{"journal-title":"Geometric huffman coding","year":"2010","author":"bochcrer","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054981"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.256499"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref9"}],"event":{"name":"2011 Data Compression Conference (DCC)","start":{"date-parts":[[2011,3,29]]},"location":"Snowbird, UT, USA","end":{"date-parts":[[2011,3,31]]}},"container-title":["2011 Data Compression Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5749456\/5749457\/05749460.pdf?arnumber=5749460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T16:53:28Z","timestamp":1489856008000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5749460\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/dcc.2011.10","relation":{},"subject":[],"published":{"date-parts":[[2011,3]]}}}