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 groups allows us to prove the nonexistence of completely transitive codes with error-correcting capability greater than 4.
|Journal||IEEE Transactions on Information Theory|
|Publication status||Published - 1 Jan 2000|