A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
| Hi-index | 754.84 |
A new generalization of the Gray map is introduced. The new generalization Phi:Z2 kn rarr Z2 2k-1n is connected with the known generalized Gray map phi in the following way: if we take two dual linear Z2 k-codes and construct binary codes from them using the generalizations phi and Phi of the Gray map, then the weight enumerators of the binary codes obtained will satisfy the MacWilliams identity. The classes of Z2 k-linear Hadamard codes and co-Z2 k-linear extended 1-perfect codes are described, where co-Z2 k-linearity means that the code can be obtained from a linear Z2 k-code with the help of the new generalized Gray map