On complete decoding of linear error-correcting codes

It is shown that minimum distance decoding of linear codes is accomplished by generating all codewords corresponding to all information sets utilizing the corresponding received coordinates. This was previously shown for the special case of maximum distance separable codes. It is shown that for codes over moderate or larger sized fields this method is more effective than that of generating all codewords