Search

A class of p-ary (n, k, d) cyclic codes with block length n = p, dimension k = 2 and minimum Hamming distance d = n - k + 1 = p - 1 is introduced, where p denotes a prime. These codes are maximum distance separable repeated-single-root cyclic codes with generator polynomial g(x) = (x-1)p-2. The codebook has size p² and contains a subset S of p(p - 1)codewords having p distinct symbols each. The size of S is maximum for the given parameters and its codewords are useful for applications of coded modulation in power-line communications. [ABSTRACT FROM AUTHOR]