Minimal permutation sets for decoding the binary Golay codes

For permutation decoding of an e error-correcting linear code, a set of permutations which move all error vectors of weight \leq e out of the information places is needed. A method of finding minimal decoding sets is given, along with minimal sets obtained with this method for the binary Golay codes.