Two Classes of Minimum Generalized Distance Decoding Algorithms

We consider two classes of erasure, choosing algorithms for decoding in the generalized distance metric with $l<\lceil(d+1)/2\rceil$ decoding attempts. In each class, we identify and investigate algorithms that minimize the loss of distance compared with the Forney algorithm.