Group codes for the Gaussian channel (Abstr.)
David Slepian · IEEE Transactions on Information Theory · 1968
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 codeCwith parametersMandnfor this channel is a collection ofMdistinct unitn-vectors,X_{1}, X_{2}, \cdots , X_{M}say, that span a Euclideann-space. Ann \times northogonal matrix0is said to be a symmetry ofCif theMvectorsY_{i} = 0X_{i}, i = 1, 2, \cdots , Mare again the collectionC. The set of all symmetries ofC, say0_{1}, 0_{2}, \cdots , 0_{g}, forms a group\cal{G}(C)under matrix multiplication. If\cal{G}(C)containsMelements0_{\alpha_{1}}, 0_{\alpha_{2}}, \cdots , 0_{\alpha M}such thatX_{i} = 0_{\alpha i}X_{1}, i = 1, 2, \cdots , M, thenCis called a group code.