On modulation coding for channels with cost constraints

We consider the problem of designing modulation codes for magnetic recording (MR) channels and other binary channels with ISI, where Markov sources are known to provide the best known lower bound on capacity. Our approach includes computing a costly channel matching a Markov source optimized for a given ISI channel. We then construct encoders and decoders for a modulation code matched to this costly channel.