Group codes for the Gaussian channel (Abstr.)

A class of equal-energy codes for use on the Gaussian channel is defined and investigated. Members of the class are eared group codes because of the manner in which they can be generated from a group of orthogonal matrices. Group codes possess an important symmetry property. Roughly speaking, all words in such a code are on an equal footing: each has the same error probability (under the assumptions of the usual model) and each has the same disposition of neighbors. A number of theorems about such codes are proved. A decomposition theorem shows every group code to be equivalent to a direct sum of certain basic group codes generated by real-irreducible representations of a finite group associated with the code. Some theorems on distances between words in group codes are demonstrated. The difficult problem of finding group codes with large nearest neighbor distance is discussed in detail and formulated in several ways. It is noted that linear (or group) codes for the binary channel can be regarded as very speciM cases of the group codes discussed. A definition of a group code for the Gaussian channel follows. An equal-energy code C with parameters M and n for this channel is a collection of M distinct unit n -vectors, X₁, X₂, , X₌ say, that span a Euclidean n -space. An n n orthogonal matrix 0 is said to be a symmetry of C if the M vectors Y₈ = 0X₈, i = 1, 2, , M are again the collection C. The set of all symmetries of C, say 0₁, 0₂, , 0₆, forms a group G (C) under matrix multiplication. If G (C) contains M elements 0_₁, 0_₂, , 0 ₌ such that X₈ = 0 ₈X₁, i = 1, 2, , M, then C is called a group code.