Coding for channels with cost constraints
We address the problem of finite-state code construction for the costly channel. Adler et al. developed powerful state-splitting algorithm for use in the construction of finite-state codes for hard-constrained channels. We extend the state-splitting algorithm to the costly channel. We present several examples of costly channels related to magnetic recording, the telegraph channel, and shaping gain modulation. We design a number of synchronous and asynchronous codes, some of which come very close to achieving capacity.