On the complete decoding of constrained codes

A maximum-likelihood algorithm for devising complete decoders for constrained codes and an algorithm for calculating the resulting error multiplication probabilities are presented. These algorithms make it possible to reduce the error multiplication when decoding the symbols of constrained codes or the symbols of various combined error correcting, constrained coding schemes after reception over channels that introduce bit errors into the symbols.<
>