Nested input-constrained codes
J. Hogan, Ron M. Roth, G. Ruckenstein · IEEE Transactions on Information Theory · 2000
An input-constrained channel, or simply a constraint, is a set S of words that is generated by a finite labeled directed graph. An encoder for S maps, in a lossless manner, sequences of unconstrained input blocks into sequences of channel blocks, the latter sequences being words of S. In most applications, the encoders are finite-state machines and, thus, presented by state diagrams. In the special case where the state diagram of the encoder is (output) deterministic, only the current encoder state and the current channel block are needed for the decoding of the current input block. In this work, the problem of designing coding schemes that can serve two constraints simultaneously is considered. Specifically, given two constraints S/sub 1/ and S/sub 2/ such that S/sub 1//spl sube/S/sub 2/ and two described rates, conditions are provided for the existence of respective deterministic finite-state encoders /spl epsi//sub 1/ and /spl epsi//sub 2/, at the given rates, such that (the state diagram of) /spl epsi//sub 1/ is a subgraph of /spl epsi//sub 2/ Such encoders are referred to as nested encoders. The provided conditions are also constructive in that they imply an algorithm for finding such encoders when they exist. The nesting structure allows to decode /spl epsi//sub 1/ while using the decoder of /spl epsi//sub 2/. Developments in optical recording suggest a potential application that can take a significant advantage of nested encoders.