DISTANCE PROPERTIES OF GROUP CODES FOR GAUSSIAN CHANNEL

Some distance properties of group codes for the Gaussian channel introduced by Slepian are examined. The concept of a full homogeneous component is introduced and optimal vectors for such group representations are found. The results are applied to the symmetric and Mathieu groups which are found to yield exceptional simplex-like codes with code size larger than the corresponding simplex code. A theorem on the representation of a doubly transitive permutation group is used to solve the optimal vector problem for the irreducible representation of dimension n - l of the symmetric group of degree n.