{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:09Z","timestamp":1773376689639,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206623","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2494-2498","source":"Crossref","is-referenced-by-count":2,"title":["Exact Asymptotics for Discrete Noiseless Channels"],"prefix":"10.1109","author":[{"given":"Andreas","family":"Lenz","sequence":"first","affiliation":[{"name":"Technical University of Munich,Institute for Communications Engineering,Germany"}]},{"given":"Stephen","family":"Melczer","sequence":"additional","affiliation":[{"name":"University of Waterloo,Department of Combinatorics & Optimization,Canada"}]},{"given":"Cyrus","family":"Rashtchian","sequence":"additional","affiliation":[{"name":"Google Research,Mountain View,California"}]},{"given":"Paul H.","family":"Siegel","sequence":"additional","affiliation":[{"name":"CMRR, University of California,Department of Electrical and Computer Engineering,San Diego"}]}],"member":"263","reference":[{"key":"ref13","article-title":"On the capacity of constrained systems","author":"b\u00f6cherer","year":"2010","journal-title":"Proc Int ITG Conf Source Channel Coding (SCC)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895601"},{"key":"ref15","author":"melczer","year":"2021","journal-title":"An Invitation to Analytic Combinatorics From One to Several Variables ser Texts & Monographs in Symbolic Computation"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139381864"},{"key":"ref11","article-title":"Analytic Asymptotics of Discrete Noiseless Channels","author":"b\u00f6cherer","year":"2007","journal-title":"Master’s thesis"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"ref2","author":"marcus","year":"2001","journal-title":"An introduction to coding for constrained systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056939"},{"key":"ref16","first-page":"245","article-title":"A maximum entropy Markov chain","author":"mceliece","year":"1983","journal-title":"Proc Conf Inform Sci Syst"},{"key":"ref19","article-title":"Multivariate analytic combinatorics for cost constrained channels and subsequence enumeration","author":"lenz","year":"2021"},{"key":"ref18","article-title":"On the design of finite-state shaping encoders for partial-response channels","author":"soriaga","year":"2006","journal-title":"Proc Inf Theory Appl Workshop"},{"key":"ref8","first-page":"115","article-title":"The discrete noiseless channel revisited","author":"khandekar","year":"2000","journal-title":"Coding Communications and Broadcasting"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref9","article-title":"Capacity of general discrete noiseless channels","author":"b\u00f6cherer","year":"2010"},{"key":"ref4","article-title":"Coding Techniques to Extend the Lifetime of Flash Memories","author":"liu","year":"2020","journal-title":"Ph D Dissertation"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5569-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834441"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2986318"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206623.pdf?arnumber=10206623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:42Z","timestamp":1773347262000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206623\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206623","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}