Minimal permutation sets for decoding the binary Golay codes (Corresp.)
Dan Gordon · IEEE Transactions on Information Theory · 1982
For permutation decoding of aneerror-correcting linear code, a set of permutations which move all error vectors of weight\leq eout 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.