{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:37Z","timestamp":1773377857236,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834441","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1354-1359","source":"Crossref","is-referenced-by-count":6,"title":["Rate-Constrained Shaping Codes for Finite-State Channels With Cost"],"prefix":"10.1109","author":[{"given":"Yi","family":"Liu","sequence":"first","affiliation":[{"name":"University of California,CMRR,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA"}]},{"given":"Yonglong","family":"Li","sequence":"additional","affiliation":[{"name":"University of California,CMRR,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA"}]},{"given":"Pengfei","family":"Huang","sequence":"additional","affiliation":[{"name":"University of California,CMRR,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA"}]},{"given":"Paul H.","family":"Siegel","sequence":"additional","affiliation":[{"name":"University of California,CMRR,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA"}]}],"member":"263","reference":[{"key":"ref10","author":"karabed","year":"1988","journal-title":"The capacity of costly noiseless channels Research report"},{"key":"ref11","first-page":"115","article-title":"The discrete noiseless channel revisited","author":"khandekar","year":"1999","journal-title":"Proc 1999 Int Symp Commun Theory and Appl"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.490550"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874867"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref15","article-title":"Multivariate analytic combinatorics for cost constrained channels and subsequence enumeration","author":"lenz","year":"2021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834441"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7842266"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2986318"},{"key":"ref19","article-title":"An introduction to coding for constrained systems","author":"marcus","year":"2001","journal-title":"Lecture notes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(71)90155-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90084-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248333"},{"key":"ref3","article-title":"On the capacity of constrained systems","author":"b\u00f6cherer","year":"2010","journal-title":"Proc Int ITG Conf Source Channel Coding (SCC)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849856"},{"key":"ref5","author":"durrett","year":"2004","journal-title":"Probability Theory and Examples"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649220"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.705558"},{"key":"ref2","article-title":"Capacity-achieving probabilistic shaping for noisy and noiseless channels","author":"b\u00f6cherer","year":"2012","journal-title":"Ph D Dissertation"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056939"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056597"},{"key":"ref20","first-page":"245","article-title":"A maximum entropy Markov chain","author":"mceliece","year":"1983","journal-title":"Proc 17th Conf Inf Sci and Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.272459"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.841193"},{"key":"ref24","first-page":"468","article-title":"On distribution shaping codes for partial-response channels","author":"soriaga","year":"2003","journal-title":"Proc Annu Allerton Conf Commun Control and Comp"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365300"},{"key":"ref25","article-title":"On the design of finite-state shaping encoders for partial-response channels","author":"soriaga","year":"2006","journal-title":"Proc of the 2006 Inf Theory and Appl Workshop (ITA2006)"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834441.pdf?arnumber=9834441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:22Z","timestamp":1773347722000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834441\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834441","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}