The construction of M-ary (d,/spl infin/) codes that achieve capacity and have the fewest number of encoder states

The existence of 100% efficient (i.e., capacity-achieving) fixed-rate codes for input-constrained, noiseless channels is guaranteed provided the channel has rational capacity. A class of M-ary runlength-limited (M,d,/spl infin/) constraints was shown in previous work to have rational capacity. In this correspondence we present a code construction procedure for obtaining 100% efficient codes with the fewest number of encoder states for all (M,d,/spl infin/) constraints with rational capacity. The decoders are sliding-block decoders with sliding window size d+1.