We show how to use the elements of a sharply k-transitive permutation group of degree n to form error-correcting codes, as suggested by Blake [1], presenting suitable decoding algorithms for these codes. In particular, we concentrate on using the Mathieu group M12 to form a (12,95040,8)-code to correct three errors. The algorithm we give for this code differs from that given by Cohen and Deza [2].