The algebraic construction of linear codes over Zm for m-PSK is considered for the case that m is the product of two distinct primes. By means of the Chinese remainder theorem (CRT), such codes can be constructed from linear codes over the corresponding prime fields. It is shown that, for given component codes, the CRT composition yields PSK codes that are at least as good, and often much better, than the codes obtained from the standard coset coding technique. A lower bound on the minimum Euclidean distance of 6 PSK codes is derived that is based on the Hamming weight distribution of the component codes. >
['Changjia Chen', 'T. Chen', 'Hans-Andrea Loeliger']
Construction of linear ring codes for 6 PSK