Abstract :
The use of multi-level p.s.k. arouses interest in non-binary error-correcting codes. This paper points out that the algorithm for constructing BCH codes can be applied when the number of levels is a prime or a power of a prime. Quaternary codes are examined. Possible extensions to higher powers of two and to decimal codes are indicated.
