Error Correcting Codes Associated with Complex Hadamard Matrices

For primes p \u3e 2, the generalized Hadamard matrix H(p,pt) can be expressed as H = xA, where the notation means hij = xaij. It is shown that the row vectors of A represent a p-ary error correcting code. Depending upon the value of t, either linear or nonlinear codes emerge. Code words are equidistant and have minimum Hamming distance d = (p − 1)t. The code can be extended so as to possess N = p2t code words of length pt − 1