Results of generalized minimum distance decoding for block code of rate 1/2

This paper deals with the performance of "Generalized Minimum Distance Decoding". In this method, a generalized distance taking into account of the reliability of the code symbol is used. We outline relationships between generalized minimum distance and correlation which are two criteria equivalent to Maximum Likelihood Decoding (MLD). A sufficient condition which guarantees the correct result of the GMD decoding algorithm is studied. For high signal-to-noise ratios, the GMD decoding algorithm enables to achieve MLD performance with a complexity O(n3). We present, by computer simulation, the behavior of the GMD algorithm for different error-correcting codes, in particular, the results for concatenated schemes (Reed-Solomon outer codes with inner convolutional codes).