Completely transitive codes were introduced by P, Sole as a special case of
binary linear completely regular codes.
The existence of such codes is closely related to the existence of certain
permutation groups. The nonexistence of highly transitive permutation group
s allows us to prove the nonexistence of completely transitive codes with e
rror-correcting capability greater than 4.